ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥5n\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 n≥5n\geq 5,

gC1,2n(t)=t+∑i=1+⌊n/2⌋n−2ni(in−i)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 n≤20n\leq 20 in the paper and is open beyond those computations.

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.