The Ehrhart and face polynomials of the graph polytope of a cycle

DOI10.1016/J.EJC.2023.103906MaRDI QIDQ6201887zbMATH OpenOpenAlexFDO

Authors Richard Ehrenborg

Publication date 26 March 2024

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

Full work available at URL https://doi.org/10.1016/j.ejc.2023.103906

zbMATH Keywords

Ehrhart quasi-polynomialspectral technique

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Recommendations

• Ehrhart polynomials of cyclic polytopes
• Ehrhart polynomials of lattice-face polytopes
• Roots of Ehrhart polynomials arising from graphs
• The general formula for the Ehrhart polynomial of polytopes with applications
• Ehrhart series for connected simple graphs

Cites work

• A probabilistic approach to the descent statistic
• Bijective proofs for some results on the descent polytope
• Computing the Continuous Discretely
• Fibonacci and Lucas numbers with applications. Volume I
• scientific article; zbMATH DE number 3887638 (Why is no real title available?)
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 575872 (Why is no real title available?)
• scientific article; zbMATH DE number 1181673 (Why is no real title available?)
• scientific article; zbMATH DE number 852058 (Why is no real title available?)
• On the Sums ∑ k = -∞ ∞ (4k + 1) -n
• The \(f\)-vector of the descent polytope
• The boustrophedon transform for descent polytopes

Cited in

(1)

• Volumes of consecutively defined sets

This page was built for publication: The Ehrhart and face polynomials of the graph polytope of a cycle

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