ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F\mathbb{F} be a fixed field and let L⊂PF2\mathcal{L} \subset \mathbb{P}^{2}_{\mathbb{F}} be an arrangement of dd lines. Its weak-combinatorics is the vector

W(L)=(d;t2,…,td),W(\mathcal{L})=(d;t_{2},\ldots,t_{d}),

where tit_i denotes the number of ii-fold intersection points, with zero entries for i>m(L)i>m(\mathcal{L}) omitted, where m(L)m(\mathcal{L}) is the maximal intersection multiplicity. A line arrangement is free when its associated derivation module is free.

Numerical Terao's conjecture. If L1,L2⊂PF2\mathcal{L}_{1},\mathcal{L}_{2}\subset\mathbb{P}^{2}_{\mathbb{F}} are line arrangements satisfying

W(L1)=W(L2),W(\mathcal{L}_{1})=W(\mathcal{L}_{2}),

then L1\mathcal{L}_{1} is free if and only if L2\mathcal{L}_{2} 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 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.