ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers n≥1n\geq 1 and kk, let C1,knC^n_{1,k} be the graph on vertices identified with {1,…,n}\{1,\ldots,n\}, obtained from the cycle by adding the edges {i,i+k}\{i,i+k\}, with vertex labels taken modulo nn. Let N2(G)\mathsf{N}_2(G) denote the coefficient of t2t^2 in Speyer's matroid polynomial gG(t)g_G(t). The circulant graph conjecture. For every integer n≥5n\geq 5,

N2(C1,n−12n)=2n−1−n.\mathsf{N}_2\big(C^{2n}_{1,n-1}\big)=2^{n-1}-n.

The formula is supported by computations for the cases tested in the paper, but remains conjectural in general.

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.