The stronger Terao conjecture for minimal degrees of line arrangements

Let A{\mathcal A} and B{\mathcal B} be arrangements of dd lines with isomorphic intersection lattices

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

Let r(A)r({\mathcal A}) denote the minimal degree of a Jacobian relation. Stronger Terao conjecture. If

r(A)<d/2,r({\mathcal A})<d/2,

then

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

This stronger form is motivated by the failure of lattice invariance of rr in general, but the source also reports counterexamples for arrangements with the same weak combinatorics, so its status is not resolved by the supplied excerpt.

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.