Universal inequalities in Ehrhart theory (Q1617946): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5421073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Continuous Discretely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the coefficients of Ehrhart polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound theorem for Ehrhart polynomials of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ehrhart Theory of Spanning Lattice Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex lattice polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of Rational Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hilbert function of a graded Cohen-Macaulay domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monotonicity property of \(h\)-vectors and \(h^*\)-vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities and Ehrhart $\delta $-vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Number Theory and Inequalities in Ehrhart Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice polytopes of degree 2 / rank
 
Normal rank

Revision as of 07:55, 17 July 2024

scientific article
Language Label Description Also known as
English
Universal inequalities in Ehrhart theory
scientific article

    Statements

    Universal inequalities in Ehrhart theory (English)
    0 references
    0 references
    0 references
    13 November 2018
    0 references
    A convex polytope in \(\mathbb R^d\) is \textit{lattice} if all of its vertices are in \(\mathbb Z^d\). From a lattice polytope \(P\) of dimension \(d\), one may construct the \textit{Ehrhart polynomial}, denoted \(\mathrm{ehr}_P(k)\), which is the unique polynomial of degree \(d\) with rational coefficients satisfying \(\mathrm{ehr}_P(k) = |kP \cap \mathbb Z^d|\) for all positive integers \(k\). Consequently, the \textit{Ehrhart series} of \(P\), \(\sum_{k \geq 0} \text{ehr}_P(k)t^k\), is rational with numerator \(\sum_{i \geq 0} h_i^*t^i\), where each \(h_i^*\) is a nonnegative integer and \(h_i^* = 0\) for \(i > d\). To simplify terminology, we call this numerator the \textit{\(h^*\)-polynomial} of \(P\), and call \(h^*(P) = (h_0^*,\dots,h_d^*)\) the \textit{\(h^*\)-vector} of \(P\). A wide open problem in Ehrhart theory is to identify when a polynomial with nonnegative integer coefficients is the \(h^*\)-polynomial of some lattice polytopes. This has been solved when the polynomial has degree at most \(2\), and are characterized by what the authors call Scott's inequalities. This article shows that, if the \(h^*\)-vector of a lattice polytope satisfies \(h_3^* = 0\), then the \(h^*\)-vector also must satisfy Scott's inequalities. In particular, the inequalities hold regardless of the dimension of \(P\) or the degree of its \(h^*\)-polynomial; the authors deem such an inequality \textit{universal}.
    0 references
    0 references
    Ehrhart polynomial
    0 references
    integer sequences
    0 references
    lattice polytopes
    0 references

    Identifiers