Thin polytopes: lattice polytopes with vanishing local \(h^*\)-polynomial (Q6623607)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Thin polytopes: lattice polytopes with vanishing local \(h^*\)-polynomial |
scientific article; zbMATH DE number 7931171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Thin polytopes: lattice polytopes with vanishing local \(h^*\)-polynomial |
scientific article; zbMATH DE number 7931171 |
Statements
Thin polytopes: lattice polytopes with vanishing local \(h^*\)-polynomial (English)
0 references
24 October 2024
0 references
A lattice polytope is \textit{thin} if its local \(h^*\)-polynomials vanish. The study of thin simplices was originated by Gelfand, Kapranov, and Zelevinsky; for simplices the local \(h^*\)-polynomial equals the box polynomial.\N\NThe paper starts with a survey of existing results around \(h\)- and \(g\)-polynomials and Ehrhart theory.\N\NThe main results are the complete classification of thin polytopes up to dimension \(3\) and the characterization of thinness for Gorenstein polytopes.
0 references
Ehrhart theory
0 references
\(g\)-polynomial
0 references
\(h\)-polynomial
0 references
lattice polytopes
0 references
Gorenstein polytopes
0 references