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

DOI10.1016/j.ejc.2023.103906OpenAlexW4389380458MaRDI QIDQ6201887

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

spectral techniqueEhrhart quasi-polynomial

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(f\)-vector of the descent polytope
• A probabilistic approach to the descent statistic
• The boustrophedon transform for descent polytopes
• On the Sums ∑ k = -∞ ∞ (4k + 1) -n
• Computing the Continuous Discretely

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