An upper bound theorem concerning lattice polytopes

DOI10.1556/012.2015.52.3.1314MaRDI QIDQ2834196zbMATH OpenOpenAlexFDO

Authors Gábor Hegedüs

Publication date 25 November 2016

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.5895

zbMATH Keywords

\(h\)-vectorCohen-Macaulay ringintegrally closed polytopelattice polytope

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Graded rings (13A02) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Abstract: R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.

Review text

A lattice polytope \(P\), with vertices in \(\mathbb{Z}^d\), is called integrally closed if, for each \(k\in \mathbb{N}\), each point in \(kP\cap\mathbb{Z}^d\) is the sum of \(k\) points in \(P\cap\mathbb{Z}^d\). A lattice polytope is called reflexive if its polar dual is also a lattice polytope. The paper establishes an upper bound for the volume of integrally closed lattice polytopes. The authors also prove unimodality of the \(\delta\)-vector of an integrally closed reflexive lattice polytope. The \(\delta\)-vector is determined by a rational function expression for the generating function of the sequence given by the values of the Ehrhart polynomial of \(P\) at the non-negative integers; see \textit{R.P. Stanley} [Ann. Discrete Math. 6, 333--342 (1980; Zbl 0812.52012)].

Recommendations

• Unimodality questions for integrally closed lattice polytopes
• Ehrhart series, unimodality, and integrally closed reflexive polytopes
• Inequalities and Ehrhart \delta -vectors
• The boundary volume of a lattice polytope
• A lower bound theorem for Ehrhart polynomials of convex polytopes

Cited in

(11)

• An upper bound on the shortness exponent of inscribable polytopes
• The lower and upper bound problems for cubical polytopes
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• Bounded remainder polyhedra
• Ehrhart polynomials and stringy Betti numbers
• The -vectors of reflexive polytopes and of the dual polytopes
• The boundary volume of a lattice polytope
• Unimodality questions for integrally closed lattice polytopes
• Ehrhart series, unimodality, and integrally closed reflexive polytopes
• A method of deducing \(L\)-polyhedra for \(n\)-lattices
• Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices

This page was built for publication: An upper bound theorem concerning lattice polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834196)