Proves palindromicity conjecture for graph polytope Ehrhart numerators and extends results to new hypergraph polytopes showing they are integer when unimodular.
An Extension of hibi's palindromic theorem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Hibi showed that the polynomial in the numerator of the Ehrhart series of a reflexive polytope is palindromic. We proved that those in the numerator of the Ehrhart series of every graph polytope (defined later) of the bipartite graph is palindromic. From this, one of the conjectures (raised in the A205497 of OEIS \cite{[O]}) follows immediately.
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.