pith. sign in

arxiv: 1503.05658 · v3 · pith:DHISRHTUnew · submitted 2015-03-19 · 🧮 math.CO

An Extension of hibi's palindromic theorem

classification 🧮 math.CO
keywords palindromicehrhartgraphhibinumeratorpolytopeseriesa205497
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Proof of a conjecture on graph polytope

    math.CO 2024-09 accept novelty 6.0

    Proves palindromicity conjecture for graph polytope Ehrhart numerators and extends results to new hypergraph polytopes showing they are integer when unimodular.