Lower bounds on the coefficients of Ehrhart polynomials

DOI10.1016/J.EJC.2008.02.009zbMath1158.52014arXiv0710.2665OpenAlexW1986071443MaRDI QIDQ2519797

Martin Henk, Makoto Tagami

Publication date: 27 January 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Related Items (16)

Valuations on Lattice Polytopes ⋮ Universal inequalities in Ehrhart theory ⋮ Inequalities and Ehrhart $\delta $-vectors ⋮ Non-level semi-standard graded Cohen-Macaulay domain with \(h\)-vector \((h_{0},h_{1},h_{2})\) ⋮ Ehrhart tensor polynomials ⋮ Lattice zonotopes of degree 2 ⋮ Gorenstein polytopes and their stringy \(E\)-functions ⋮ Difference of Hilbert series of homogeneous monoid algebras and their normalizations ⋮ Rational polytopes with Ehrhart coefficients of arbitrary period ⋮ Lattice polytopes having \(h^*\)-polynomials with given degree and linear coefficient ⋮ Best possible lower bounds on the coefficients of Ehrhart polynomials ⋮ Periods of Ehrhart coefficients of rational polytopes ⋮ Universal conditions on \(h^*\)-vectors of lattice simplices ⋮ Gorenstein polytopes with trinomial \(h^*\)-polynomials ⋮ Enumeration of lattice polytopes by their volume ⋮ The characterisation problem of Ehrhart polynomials of lattice polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Ehrhart series formula for reflexive polytopes
• Lattice polytopes of degree 2
• A Blichfeldt-type inequality for the surface area
• Lattice points in lattice polytopes
• On the number of faces of centrally-symmetric simplicial polytopes
• A lower bound theorem for Ehrhart polynomials of convex polytopes
• Notes on the roots of Ehrhart polynomials
• Computing the Continuous Discretely
• On convex lattice polygons
• Decompositions of Rational Convex Polytopes
• Convex and Discrete Geometry
• Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.

This page was built for publication: Lower bounds on the coefficients of Ehrhart polynomials