Bóna–Ju–Ann palindromicity conjecture for circular graph polytopes

About 2 years old · traced to

Let GG have vertex set V={1,2,…,k}V=\{1,2,\ldots,k\} and edge set consisting of all pairs {i,i+1}\{i,i+1\}, with k+1k+1 identified with 11; such a graph is called a circular graph. Let ℓ∈P\ell\in\mathbb{P}.

Bóna–Ju–Ann conjecture. If k=2ℓk=2\ell, then

Ehr(P(G),x)(1−x)2ℓ+1\mathrm{Ehr}(P(G),x)(1-x)^{2\ell+1}

is a polynomial in xx of degree 2ℓ−22\ell-2 with symmetric coefficients. If k=2ℓ+1k=2\ell+1, then

Ehr(P(G),x)(1−x)2ℓ+2(1+x)\mathrm{Ehr}(P(G),x)(1-x)^{2\ell+2}(1+x)

is a polynomial in xx of degree 2ℓ2\ell with symmetric coefficients.

The source states that this conjecture is confirmed using a result from another paper, so it is solved.

References

Primary source

Feihu Liu, “Proof of a conjecture on graph polytope”, arXiv:2409.11970 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.