ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A{\mathcal A} be a supersolvable line arrangement consisting of d=∣A∣d=|{\mathcal A}| lines, and suppose that A{\mathcal A} is not a pencil. Denote by n2n_2 the number of intersection points of multiplicity two. Double-point conjecture. Then

n2≥d2.n_2 \geq \frac{d}{2}.

This conjecture was checked for all non-pencil supersolvable arrangements that are either real or have at most 1212 lines. It is also established in several classes, including the cases described in the paper, but remains open in general.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.