Empty simplices of polytopes and graded Betti numbers
Uwe Nagel
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.
Create a lesson
Related papers
On the weak Lefschetz property of Artinian Gorenstein algebras of codimension three in arbitrary characteristic
Omkar Javadekar
Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks
Kathlén Kohn, Giovanni Luca Marchetti, Alex Massarenti et al.
Comparing v-numbers of symbolic and ordinary powers of squarefree monomial ideals
Trung Chau, Tài Huy Hà, A. V. Jayanthan et al.
Polynomial extensions do not preserve the strong finite type property
Viet-Hoang Tran, Phan Thanh Toan, Thieu N. Vo et al.
Reduction numbers for witnesses to the generalized Loewy length
Richard Bartels, Sarah Dajani, Gabriel Koomson
Multi-graded generic initial ideals, regularity, and the optimal colorful fractional Helly theorem for d-Leray complexes
Daniel McGinnis