Best possible lower bounds on the coefficients of Ehrhart polynomials
From MaRDI portal
(Redirected from Publication:499482)
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 .
Recommendations
- Lower bounds on the coefficients of Ehrhart polynomials
- scientific article; zbMATH DE number 5542493
- Norm bounds for Ehrhart polynomial roots
- Lower bounds for a polynomial in terms of its coefficients
- scientific article; zbMATH DE number 3846868
- 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
- scientific article; zbMATH DE number 273025 (Why is no real title available?)
- A lower bound theorem for Ehrhart polynomials of convex polytopes
- Computing the Continuous Discretely
- Counterexamples of the conjecture on roots of Ehrhart polynomials
- Decompositions of Rational Convex Polytopes
- Inequalities and Ehrhart $\delta $-vectors
- Lattice points in lattice polytopes
- Lower bounds on the coefficients of Ehrhart polynomials
- On the Hilbert function of a graded Cohen-Macaulay domain
- Polynômes arithmétiques et méthode des polyedres en combinatoire
Cited in
(3)
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)