Best possible lower bounds on the coefficients of Ehrhart polynomials
From MaRDI portal
Publication:499482
DOI10.1016/J.EJC.2015.06.003zbMATH Open1327.52023arXiv1501.02138OpenAlexW2951621462MaRDI QIDQ499482FDOQ499482
Publication date: 30 September 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: For an integral convex polytope , we recall the Ehrhart polynomial of . Let be the th coefficients of for . Martin Henk and Makoto Tagami gave lower bounds on the coefficients in terms of the volume of . They proved that these bounds are best possible for . We show that these bounds are also optimal for and even and we give a new best possible bound for .
Full work available at URL: https://arxiv.org/abs/1501.02138
Recommendations
- Lower bounds on the coefficients of Ehrhart polynomials
- scientific article
- Norm bounds for Ehrhart polynomial roots
- Lower bounds for a polynomial in terms of its coefficients
- scientific article
- scientific article; zbMATH DE number 999557
- scientific article; zbMATH DE number 2223032
- scientific article; zbMATH DE number 3871476
- Bounds on the coefficients of the characteristic and minimal polynomials
Cites Work
- On the Hilbert function of a graded Cohen-Macaulay domain
- A lower bound theorem for Ehrhart polynomials of convex polytopes
- Lower bounds on the coefficients of Ehrhart polynomials
- Inequalities and Ehrhart $\delta $-vectors
- Computing the Continuous Discretely
- Decompositions of Rational Convex Polytopes
- Lattice points in lattice polytopes
- Title not available (Why is that?)
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Counterexamples of the conjecture on roots of Ehrhart polynomials
Cited In (2)
This page was built for publication: Best possible lower bounds on the coefficients of Ehrhart polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499482)