The circulant graph conjecture for Speyer's polynomial
Statement
For integers and , let be the graph on vertices identified with , obtained from the cycle by adding the edges , with vertex labels taken modulo . Let denote the coefficient of in Speyer's matroid polynomial . The circulant graph conjecture. For every integer ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.