Terao's minimal-degree conjecture for free line arrangements

Let A{\mathcal A} and B{\mathcal B} be line arrangements with isomorphic intersection lattices

L(A)L(B).L({\mathcal A})\cong L({\mathcal B}).

For an arrangement A{\mathcal A}, let r(A)r({\mathcal A}) denote the minimal degree of a Jacobian relation. Terao's minimal-degree conjecture. If A{\mathcal A} is free, then

r(A)=r(B).r({\mathcal A})=r({\mathcal B}).

This is presented as the line-arrangement reformulation of Terao's freeness conjecture and is open; the intersection lattice does not determine rr for arbitrary line arrangements.

Sources & referencesView supporting material

Primary source

Takuro Abe, Alexandru Dimca and Gabriel Sticlaru, “Addition-deletion results for the minimal degree of logarithmic derivations of arrangements”, arXiv:1908.06885 (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.