Proves palindromicity conjecture for graph polytope Ehrhart numerators and extends results to new hypergraph polytopes showing they are integer when unimodular.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Proof of a conjecture on graph polytope
Proves palindromicity conjecture for graph polytope Ehrhart numerators and extends results to new hypergraph polytopes showing they are integer when unimodular.