arXiv · math/0512297
Empty simplices of polytopes and graded Betti numbers
Abstract
The conjecture of Kalai, Kleinschmidt, and Lee on the number of empty simplices of a simplicial polytope is established by relating it to the first graded Betti numbers of the polytope. The proof allows us to derive explicit optimal bounds on the number of empty simplices of any given dimension. As a key result, we prove optimal bounds for the graded Betti numbers of any standard graded K-algebra in terms of its Hilbert function.
Explore related subjects
Keep this discovery
Uwe Nagel. 2005-12-14. Empty simplices of polytopes and graded Betti numbers. https://arxiv.org/abs/math/0512297
Cite the original work for its findings. Save a collection to share your selection of sources.