Spectral-gap equality conjecture for generalised pancake graphs
Spectral-gap equality conjecture for generalised pancake graphs
Let be the generalised pancake graph and let be the associated matrix used in the paper. For a symmetric matrix or graph, write and for its largest and second-largest eigenvalues. Spectral-gap equality conjecture. For integers and ,
This is proposed from cursory computational evidence and asserts that the spectral gap of the generalised pancake graph is exactly captured by the associated matrix . No proof or resolution is supplied in the paper.
Progress summary
The equality is known only in the one-parameter case, and no proof or counterexample for the general case has been publicly verified.
The conjecture asserts that the spectral gap of the generalised pancake graph equals that of its associated matrix . It was presented as a computationally motivated conjecture in the paper A note on some spectral properties of generalised pancake graphs.
Known results
- Cesi proved the equality for .
- For , the equality remains open.
- The note proves strict spectral-gap bounds: less than for , and less than otherwise.
2025 note and subsequent scan
The 2025 note settles other spectral conjectures but neither proves nor refutes this equality. No retrieved source reports a counterexample, claimed proof, or verification through August 2026.
Current status (as of August 2026): The case is settled by Cesi, while the conjecture for remains open.
Sources & referencesView supporting material
Primary source
Gary R. W. Greaves and Haoran Zhu, “A note on some spectral properties of generalised pancake graphs”, arXiv:2509.09425 (2026).
Additional references
9 papers in this index state this conjecture (2001–2025). The statement above is taken from the most recent of them; the others are arXiv:2506.08345, arXiv:2208.02619, arXiv:2112.11864, arXiv:2106.08436, arXiv:2003.04432, arXiv:1906.11656, arXiv:1412.7488, arXiv:math-ph/0110017.
Solutions 1
Sign in to submit a solution.
Counterexample at , with a completely exact six-dimensional spectral certificate.
The original conjecture is Greaves–Zhu, Discrete Mathematics 349 (2026), 115102, Conjecture 2. The subsequent paper S. A. Blanco, arXiv:2608.15398, Section 5, posted August 15, 2026, explicitly states that this same full-graph versus Schreier-quotient spectral-gap equality remains open. Its counterexample to a different expander conjecture does not address the equality considered here.
Take the generalized pancake graph
It has vertices, is -regular, and has top adjacency eigenvalue .
Let , and for a color word write
These are functions on the full colored-permutation graph. If reverses the first coordinates, direct application of the six prefix-flip generators gives
The orbit
spans an invariant subspace. In this order, (1) acts by the integer symmetric matrix
Its characteristic polynomial is exactly
Every orbit character is orthogonal to constants. Therefore
is a nontrivial full-graph eigenvalue, and
The conjectured equitable quotient records the color and position of one distinguished symbol. Its Fourier blocks are
For ,
so its nontrivial eigenvalues are and .
For the other three blocks, use . The successive leading principal minors of are
All entries are strictly positive because . Sylvester's criterion therefore shows that every eigenvalue of these blocks is strictly less than . Consequently
Since both graphs have top eigenvalue ,
The proposed spectral-gap equality is therefore false.