Quadratic generation conjecture for join-meet binomial algebras of simple planar distributive lattices
Quadratic generation conjecture for join-meet binomial algebras of simple planar distributive lattices
Let be a simple planar distributive lattice, and let be its join-meet binomial algebra with defining ideal . An interval is a sublattice of consisting of all elements between two fixed elements; write for the corresponding divisor lattice.
Quadratic generation conjecture. The defining ideal is generated by quadrics if and only if at most one interval is .
The preceding results show that sufficiently complicated interval configurations force relations of degree greater than two, while the conjecture proposes that having at most one interval of type is also sufficient for quadratic generation. The conjecture is presented as open in the source.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Barbara Betti and Takayuki Hibi, “Join-meet binomial algebras of distributive lattices”, arXiv:2603.14506 (2026).
Additional references
4 papers in this index state this conjecture (2003–2026). The statement above is taken from the most recent of them; the others are arXiv:1904.07563, arXiv:math/0606683, arXiv:math/0301255.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.