Supersolvable resolutions of line arrangements (Q6172008)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Supersolvable resolutions of line arrangements |
scientific article; zbMATH DE number 7713999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Supersolvable resolutions of line arrangements |
scientific article; zbMATH DE number 7713999 |
Statements
Supersolvable resolutions of line arrangements (English)
0 references
18 July 2023
0 references
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!
0 references
supersolvable line arrangements
0 references
0 references
0.95572567
0 references
0.9531563
0 references
0.91649204
0 references
0.9156389
0 references
0 references
0.9065088
0 references
0.8989963
0 references
0.89563996
0 references
0.8869031
0 references