ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite simple connected graph, and let P(G)P(G) be its graph polytope. Write its Ehrhart series as

Ehr(P(G),x)=∑n≥0#W(G,n)xn.\mathrm{Ehr}(P(G),x)=\sum_{n\geq 0}\#W(G,n)x^n.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.