Ju's palindromicity conjecture for graph polytope Ehrhart numerators
Statement
Let be a finite simple connected graph, and let be its graph polytope. Write its Ehrhart series as
Ju's conjecture. The polynomial in the numerator of this Ehrhart series is symmetric, also known as palindromic.
The conjecture was proposed by Ju and was previously confirmed for bipartite graphs, equivalently graphs with no odd cycles. The source states that the paper solves it.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.