On complex supersolvable line arrangements
Abstract
We show that the number of lines in an --homogeneous supersolvable line arrangement is upper bounded by and we classify the --homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower bound for the number of double points in an --homogeneous supersolvable line arrangement of lines is also considered. When , or when , or when there are at least two modular points, we show that , as conjectured by B. Anzis and S. O. Toh\u aneanu. This conjecture is shown to hold also for supersolvable line arrangements obtained as cones over generic line arrangements, or cones over arbitrary line arrangements having a generic vertex.
Cite
@article{arxiv.1907.12497,
title = {On complex supersolvable line arrangements},
author = {Takuro Abe and Alexandru Dimca},
journal= {arXiv preprint arXiv:1907.12497},
year = {2019}
}
Comments
v.9: Takuro Abe joins as a co-author, after proving that the conjectural upper bounds 3m-3 holds indeed. This fact simplified some of our proofs in the sequel