Supersolvable resolutions of line arrangements

preprint2022arXivOpen access

Abstract

The main purpose of the present paper is to study the numerical properties of supersolvable resolutions of line arrangements. We provide upper-bounds on the so-called extension to supersolvability numbers for certain extreme line arrangements in PC2\mathbb{P}^{2}_{\mathbb{C}} and we show that these numbers \textbf{are not} determined by the intersection lattice of the given arrangement.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.