The supersolvable Sylvester–Gallai conjecture over the complex numbers

Let K=C{\mathbb K}={\mathbb C}, and let A{\mathcal A} be a supersolvable projective line arrangement. Write n2(A)n_2({\mathcal A}) for the number of its double points.

Supersolvable Sylvester–Gallai conjecture. One has

n2(A)>0.n_2({\mathcal A})>0.

This is the supersolvable version of the Sylvester–Gallai theorem and is weaker than the preceding double-point lower-bound conjecture. Since the stronger lower bound is established in the paper, this conjecture is also solved.

Sources & referencesView supporting material

Primary source

Takuro Abe, “Double points of free projective line arrangements”, arXiv:1911.10754 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.