Terao's minimal-degree conjecture for free line arrangements
Terao's minimal-degree conjecture for free line arrangements
Let and be line arrangements with isomorphic intersection lattices
For an arrangement , let denote the minimal degree of a Jacobian relation. Terao's minimal-degree conjecture. If is free, then
This is presented as the line-arrangement reformulation of Terao's freeness conjecture and is open; the intersection lattice does not determine 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
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.