The stronger Terao conjecture for minimal degrees of line arrangements
The stronger Terao conjecture for minimal degrees of line arrangements
Let and be arrangements of lines with isomorphic intersection lattices
Let denote the minimal degree of a Jacobian relation. Stronger Terao conjecture. If
then
This stronger form is motivated by the failure of lattice invariance of 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.