Sturmfels–Thomas bounded-facet conjecture for Gröbner fans
Let be a matrix of rank . The Gröbner fan of is the fan whose cones encode the reduced Gröbner bases of the toric ideal associated to . Sturmfels–Thomas's conjecture. There exists a function such that every cone of the Gröbner fan of has at most facets. This conjecture concerns uniform bounds on the combinatorial complexity of Gröbner fans in integer programming.
References
- Serkan Hosten, “On the Complexity of Smooth Projective Toric Varieties”, arXiv:alg-geom/9611010 (1996).
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.