The zigzag circulant closed-form conjecture for Speyer's polynomial

From papers

For n5n\geq 5, let C1,2nC^n_{1,2} be the circulant graph obtained from the cycle on nn vertices by adding the edges joining each vertex to the vertex two steps away, with indices taken modulo nn. Let gG(t)g_G(t) denote Speyer's matroid polynomial. The zigzag circulant conjecture. For every integer n5n\geq 5,

gC1,2n(t)=t+i=1+n/2n2ni(ini)t(1+t)i+{t(1+t)2if n is even,0if n is odd.g_{C^{n}_{1,2}}(t)=t+\sum_{i=1+\lfloor n/2\rfloor}^{n-2}\frac{n}{i}\binom{i}{n-i}t(1+t)^i+\begin{cases}t(1+t)^2&\text{if $n$ is even,}\\0&\text{if $n$ is odd.}\end{cases}

The formula was confirmed computationally for all n20n\leq 20 in the paper and is open beyond those computations.

Progress summary

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

Sources & referencesView supporting material

Primary source

Erik Panzer, “Graph theoretic properties of Speyer's matroid polynomial g_M(t)”, arXiv:2506.18788 (2025).

Solutions 0

No solutions have been posted yet.