Supersolvable resolutions of line arrangements

2022/01/13 by Jakub Kabat, Kabat, Jakub
Mathematics · #14C20 #52C35 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.2201.04856

openalex publication_date 2022/01/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 ℙ²_ℂ and we show that these numbers are not determined by the intersection lattice of the given arrangement.

Related

• Real and complex supersolvable line arrangements in the projective plane
• On complex supersolvable line arrangements
• On the geometry of real or complex supersolvable line arrangements
• On supersolvable and nearly supersolvable line arrangements
• Free arrangements with low exponents