Supersolvable resolutions of line arrangements
In the paper under review, the author defines and studies certain numbers that can be attached to line arrangements in a projective plane called the extensions to supersolvability numbers of arrangements \(\mathcal{A} \subset \mathbb{P}^{2}_{\mathbb{F}}\). This work is strongly motivated by the freeness of hyperplane arrangements and the Terao's conjecture. First of all, for an arrangement \(\mathcal{A} \subset \mathbb{P}^{n}_{\mathbb{F}}\), where \(\mathbb{F}\) is an arbitrary field, a supersolvability resolution of \(\mathcal{A}\) is defined to be a finite sequence of hyperplane arrangements \[Y_{\bullet} \, : \, X =Y_{0} \subseteq Y_{1} \subseteq Y_{1} \cdots \subseteq Y_{k} = Y\] such that \(|Y_{i}|=|\mathcal{A}|+i\) for \( 0 \leq i \leq k\) and \(Y\) is supersolvable. Based on that, the author defines the following. Definition. Let \(\mathcal{A} \subset \mathbb{P}^{n}_{\mathbb{K}}\) be an arrangement of hyperplanes. Then one defines the extension to supersolvability number of \(\mathcal{A}\) as \[\mathrm{extSS}(\mathcal{A}) = \min \{k : Y_{\bullet} \text{ is a supersolvable resolution of }\mathcal{A} \text{ and } Y_{k} \text{ is supersolvable}\}.\] In the present paper the author concentrates on the case of arrangements of lines. It follows immediately that these numbers are well-defined and finite, namely for a given arrangement of lines \(\mathcal{A}\) one has \[\mathrm{extSS}(\mathcal{A}) \leq |\mathrm{Sing}(\mathcal{A})|,\] where \(\mathrm{Sing}(\mathcal{A})\) is the set of all singular points of \(\mathcal{A}\). The main contribution of the author is an observation saying that the extension to supersolvability numbers are not determined by the combinatorics, i.e. the intersection lattices. In addition, he provides several results which give us explicit upper bounds on these extension numbers for certain arrangements of lines. However, based on the discussion presented by the author, he could do better and give the actual values of the extension to supersolvability numbers for arrangements of Wiman and Klein, since in these arrangements are rigid!
- On supersolvable and nearly supersolvable line arrangements
- On complex supersolvable line arrangements
- On the geometry of real or complex supersolvable line arrangements
- Real and complex supersolvable line arrangements in the projective plane
- Supersolvable simplicial arrangements
- A computational criterion for the supersolvability of line arrangements.
- The supersolvable order of hyperplanes of an arrangement
- Simple geometric characterization of supersolvable arrangements
- Free arrangements of hyperplanes and supersolvable lattices
- scientific article; zbMATH DE number 2108153
- Arrangements of Lines with a Large Number of Triangles
- Free arrangements of hyperplanes and supersolvable lattices
- Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
- Matroid Representations and free Arrangements
- Unexpected curves arising from special line arrangements
- Real and complex supersolvable line arrangements in the projective plane
- On supersolvable and nearly supersolvable line arrangements
- On complex supersolvable line arrangements
- A computational criterion for the supersolvability of line arrangements.
- Isomorphism between arrangements and matroids and some properties of super-solvability
- scientific article; zbMATH DE number 2108153 (Why is no real title available?)
- On the containment I(3) ⊂ I2 and configurationsof triple points in Böröczky line arrangements
This page was built for publication: Supersolvable resolutions of line arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172008)
