Real and complex supersolvable line arrangements in the projective plane
Pith reviewed 2026-05-24 19:59 UTC · model grok-4.3
The pith
Nontrivial complex line arrangements in the projective plane have at most four modular points.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
A nontrivial complex line arrangement cannot have more than four modular points; moreover, if all crossing points of a complex line arrangement have multiplicity three or four, then the arrangement has zero modular points and cannot be supersolvable.
What carries the argument
Modular points of a line arrangement, which determine supersolvability when sufficiently many exist outside the trivial pencil and near-pencil cases.
If this is right
- Any complex supersolvable arrangement must contain at least one point of multiplicity two.
- Arrangements whose crossings are all of multiplicity three or four are excluded from being supersolvable over the complexes.
- The results narrow the possible combinatorial types for supersolvable complex arrangements with a given number of lines.
- The bound of four modular points supplies a concrete step toward the stronger conjecture that every nontrivial complex supersolvable arrangement with s lines has at least s/2 points of multiplicity two.
Where Pith is reading between the lines
- The real case may admit more modular points than the complex case, since the paper treats the two fields separately.
- A full combinatorial classification of supersolvable arrangements would likely need separate lists for the real and complex settings.
- The multiplicity-two requirement, if true, would imply that supersolvable complex arrangements cannot be too uniform in their point multiplicities.
Load-bearing premise
The standard definitions of supersolvability and modular points for line arrangements in the complex projective plane, together with the exclusion of pencils and near pencils.
What would settle it
An explicit example of a nontrivial complex line arrangement with five or more modular points, or a supersolvable complex arrangement whose crossing points all have multiplicity three or four.
Figures
read the original abstract
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil) complex line arrangement cannot have more than 4 modular points, and if all of the crossing points of a complex line arrangement have multiplicity 3 or 4, then the arrangement must have 0 modular points (i.e., it cannot be supersolvable). This provides at least a little evidence for our conjecture that every nontrivial complex supersolvable line arrangement has at least one point of multiplicity 2, which in turn is a step toward the much stronger conjecture of Anzis and Toh\v{a}neanu that every nontrivial complex supersolvable line arrangement with $s$ lines has at least $s/2$ points of multiplicity 2.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies supersolvable line arrangements in the projective plane over the reals and over the complex numbers. Its main results are that a nontrivial complex line arrangement cannot have more than 4 modular points, and that if every crossing point has multiplicity 3 or 4 then the arrangement has no modular points (hence cannot be supersolvable). These statements are presented as evidence toward the conjecture that every nontrivial complex supersolvable arrangement has at least one point of multiplicity 2.
Significance. If the stated bounds are correct, they supply explicit combinatorial restrictions on modular points that advance the program of classifying supersolvable arrangements and give supporting evidence for the Anzis–Tohăneanu conjecture on the minimal number of double points. The exclusion of pencils and near-pencils is standard and keeps the statements focused on the nontrivial case.
major comments (1)
- [Abstract] Abstract: the two main theorems are asserted without any indication of the proof strategy, key lemmas, or verification steps. Because the central claims are these bounds, the absence of even an outline of the combinatorial argument makes it impossible to assess whether the analysis is free of gaps or hidden reductions to prior results.
Simulated Author's Rebuttal
We thank the referee for their report. The single major comment concerns the abstract, which we address below. We agree the abstract can be strengthened and will revise accordingly.
read point-by-point responses
-
Referee: [Abstract] Abstract: the two main theorems are asserted without any indication of the proof strategy, key lemmas, or verification steps. Because the central claims are these bounds, the absence of even an outline of the combinatorial argument makes it impossible to assess whether the analysis is free of gaps or hidden reductions to prior results.
Authors: We agree that the abstract would be improved by a concise indication of the approach. The proofs proceed by a direct combinatorial analysis of the intersection lattice of the arrangement, using the definition of modular points and the supersolvability condition to bound their number; the arguments are self-contained and do not reduce to external classification results. In the revised manuscript we will append one sentence to the abstract summarizing this strategy. revision: yes
Circularity Check
No significant circularity; claims rest on standard combinatorial definitions
full rationale
The paper states explicit bounds on the number of modular points in nontrivial complex supersolvable line arrangements (at most 4, or 0 when all multiplicities are 3 or 4) after excluding pencils and near-pencils. These rest on the standard definitions of supersolvability via modular elements in the intersection lattice and of modular points for central arrangements in P^2. No load-bearing step reduces by construction to a fitted parameter, self-citation chain, or renamed input; the derivation is combinatorial and self-contained against external benchmarks such as the intersection lattice. The mentioned conjectures are explicitly labeled as such and do not support the main theorems.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Standard properties of the complex projective plane P^2 and its lines
- domain assumption Definition of supersolvable arrangement and modular point
Reference graph
Works this paper leans on
-
[1]
B. Anzis and Ş. O. Tohˇ aneanu, On the geometry of real or co mplex supersolvable line arrangements, J. Combin. Theory Ser. A 140 (2016), 76–96
work page 2016
- [2]
- [3]
-
[4]
D. Cook II, B. Harbourne, J. Migliore and U. Nagel, Line ar rangements and configurations of points with an unexpected geometric property, Compos. Math. 154 (2018), no. 10, 2150–2194
work page 2018
-
[5]
M. Di Marca, G. Malara, A. Oneto, Unexpected curves arisi ng from special line arrangements, to appear, Journal of Algebraic Combinatorics (arXiv:1804.0 2730)
-
[6]
Dirac, Collinearity properties of sets of points, Qua rt
G. Dirac, Collinearity properties of sets of points, Qua rt. J. Math. 2 (1951), 221–227
work page 1951
-
[7]
M. Dumnicki, B. Harbourne, U. Nagel, A. Seceleanu, T. Sze mberg and H. Tutaj-Gasińska, Resur- gences for ideals of special point configurations in PN coming from hyperplane arrangements, J. Algebra 443 (2015), 383–394
work page 2015
-
[8]
M. Dumnicki, T. Szemberg and H. Tutaj-Gasińska, Counter examples to the I (3) ⊂ I 2 containment, J. Algebra 393 (2013), 24–29
work page 2013
-
[9]
Hirzebruch, Arrangements of lines and algebraic surf aces, in Arithmetic and geometry, Vol
F. Hirzebruch, Arrangements of lines and algebraic surf aces, in Arithmetic and geometry, Vol. II , 113–140, Progr. Math., 36, Birkhäuser, Boston, MA
-
[10]
Klein, Ueber die Transformation siebenter Ordnung d er elliptischen Functionen, Math
F. Klein, Ueber die Transformation siebenter Ordnung d er elliptischen Functionen, Math. Ann. 14 (1878), no. 3, 428–471
-
[11]
Melchior, Über Vielseite der projektiven Ebene, Deu tsche Math
E. Melchior, Über Vielseite der projektiven Ebene, Deu tsche Math. 5 (1941), 461–475
work page 1941
-
[12]
Ş. O. Tohˇ aneanu, A computational criterion for supers olvability of line arrangements, Ars Combin. 117 (2014) 217–223. SUPERSOL V ABLE LINE ARRANGEMENTS 17
work page 2014
-
[13]
Wiman, Zur Theorie der endlichen Gruppen von biratio nalen Transformationen in der Ebene, Math
A. Wiman, Zur Theorie der endlichen Gruppen von biratio nalen Transformationen in der Ebene, Math. Ann. 48 (1896), no. 1-2, 195–240. Chennai Mathematical Institute, H1 SIPCOT IT Park, Siruseri, Kelambakkam 603103, India E-mail address : krishna@cmi.ac.in Department of Mathematics, University of Nebraska-Lincoln, L incoln, NE 68588, USA E-mail address : br...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.