The circulant orbit–eigenvalue conjecture
The circulant orbit–eigenvalue conjecture
Let be an uncoloured circulant graph. Write for the set of unordered pairs of vertices of , and let act on through its action on vertices. Let be the number of orbits of this action and let be the number of distinct eigenvalues of the adjacency matrix of .
Circulant orbit–eigenvalue conjecture. The number of orbits of the action of on coincides with the number of distinct eigenvalues of its adjacency matrix; equivalently, .
This is stated as equivalent to the preceding conjecture in the uniform-coloured setting. The source gives no resolution, so the claim remains open here.
Sources & referencesView supporting material
Primary source
Isobel Davies and Orlando Marigliano, “Coloured Graphical Models and their Symmetries”, arXiv:2012.01905 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.