The recursive term-order conjecture for lecture-hall Gröbner bases

About 11 years old · traced to

Let InI_n be the toric ideal defining the semigroup algebra C[Ln∩Zn]\mathbb{C}[L_n\cap\mathbb{Z}^n]. Order its variables lexicographically according to the recursively arranged Hilbert basis generators: when passing from n−1n-1 to nn, copy each previous block and place nn−1\begin{array}{c}n \\ n-1\end{array} above the copied columns.

Recursive term-order conjecture. For this choice of term order, the recursive Gröbner basis conjecture for InI_n 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 n≤7n\leq 7 and remains unproved.

References

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

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.