Freeness and near freeness are combinatorial for line arrangements in small degrees

2017/12/12 by Dimca, Alexandru, Ibadula, Denis, Macinic, Anca
#32S22 #Algebraic Geometry (math.AG) #Algebraic Topology (math.AT) #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1712.04400

Abstract

We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane and that the property of being nearly free is combinatorial for line arrangements of up to 12 lines in the complex projective plane.

Related

• On some freeness-type properties for line arrangements
• On nearly free arrangements of lines with nodes and triple points
• The smallest line arrangement which is free but not recursively free
• Addition-deletion theorem for free hyperplane arrangements and combinatorics
• On supersolvable and nearly supersolvable line arrangements