The recursive term-order conjecture for lecture-hall Gröbner bases
The recursive term-order conjecture for lecture-hall Gröbner bases
Let be the toric ideal defining the semigroup algebra . Order its variables lexicographically according to the recursively arranged Hilbert basis generators: when passing from to , copy each previous block and place above the copied columns.
Recursive term-order conjecture. For this choice of term order, the recursive Gröbner basis conjecture for is true.
The proposed order is intended to realize the recursive structure and Sperner-pair count in the preceding Gröbner basis conjecture. The claim is based on computational evidence for and remains unproved.
Sources & referencesView supporting material
Primary source
Matthias Beck, Benjamin Braun, Matthias Köppe, Carla D. Savage and Zafeirakis Zafeirakopoulos, “Generating functions and triangulations for lecture hall cones”, arXiv:1508.04619 (2017).
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.