Numerical Terao's conjecture for line arrangements
Statement
Let be a fixed field and let be an arrangement of lines. Its weak-combinatorics is the vector
where denotes the number of -fold intersection points, with zero entries for omitted, where is the maximal intersection multiplicity. A line arrangement is free when its associated derivation module is free.
Numerical Terao's conjecture. If are line arrangements satisfying
then is free if and only if is free.
This asks whether freeness can be determined by the numerical data of intersection points, which is weaker than the full intersection lattice. The source presents it as a weaker version of Terao's conjecture; no resolution is given.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.