Spectral-gap equality conjecture for generalised pancake graphs

From papers

Let Pm(n)\mathcal P_m(n) be the generalised pancake graph and let Q(Pm,n)Q(\mathfrak P_{m,n}) be the associated matrix used in the paper. For a symmetric matrix or graph, write λ1\lambda_1 and λ2\lambda_2 for its largest and second-largest eigenvalues. Spectral-gap equality conjecture. For integers m1m\geqslant 1 and n2n\geqslant 2,

λ1(Pm(n))λ2(Pm(n))=λ1(Q(Pm,n))λ2(Q(Pm,n)).\lambda_1(\mathcal P_m(n)) - \lambda_2(\mathcal P_m(n)) = \lambda_1(Q(\mathfrak P_{m,n})) - \lambda_2(Q(\mathfrak P_{m,n})).

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 Q(Pm,n)Q(\mathfrak P_{m,n}). No proof or resolution is supplied in the paper.

Progress summary

Open

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 Q(Pm,n)Q(\mathfrak P_{m,n}). 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 m=1m=1.
  • For m2m\geqslant 2, the equality remains open.
  • The note proves strict spectral-gap bounds: less than 11 for m=2m=2, and less than 22 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 m=1m=1 is settled by Cesi, while the conjecture for m2m\geqslant 2 remains open.

Sources
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

Counterexample

Counterexample at m=6, n=3m=6,\ n=3, 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

P6(3)=Cay((Z/6Z)3S3,{rk+,rk:1k3}).\mathcal P_6(3) = \operatorname{Cay}\bigl((\mathbb Z/6\mathbb Z)^3\rtimes S_3, \{r_k^+,r_k^-:1\le k\le3\}\bigr).

It has 633!=12966^3\cdot3!=1296 vertices, is 66-regular, and has top adjacency eigenvalue 66.

Let ζ=e2πi/6\zeta=e^{2\pi i/6}, and for a color word c=(c1,c2,c3)c=(c_1,c_2,c_3) write

χa(c,σ)=ζa1c1+a2c2+a3c3,a(Z/6Z)3.\chi_a(c,\sigma) = \zeta^{a_1c_1+a_2c_2+a_3c_3}, \qquad a\in(\mathbb Z/6\mathbb Z)^3.

These are functions on the full colored-permutation graph. If RkaR_ka reverses the first kk coordinates, direct application of the six prefix-flip generators gives

Aχa=k=132cos(π3j=1kaj)χRka.(1)A\chi_a = \sum_{k=1}^3 2\cos\left(\frac{\pi}{3}\sum_{j=1}^k a_j\right) \chi_{R_ka}. \tag{1}

The orbit

(0,1,5), (0,5,1), (1,0,5), (1,5,0), (5,0,1), (5,1,0)(0,1,5),\ (0,5,1),\ (1,0,5),\ (1,5,0),\ (5,0,1),\ (5,1,0)

spans an invariant subspace. In this order, (1) acts by the integer symmetric matrix

M=(201002020210101020020102012010200201).M= \begin{pmatrix} 2&0&1&0&0&2\\ 0&2&0&2&1&0\\ 1&0&1&0&2&0\\ 0&2&0&1&0&2\\ 0&1&2&0&1&0\\ 2&0&0&2&0&1 \end{pmatrix}.

Its characteristic polynomial is exactly

det(xIM)=(x3)(x+1)(x25x+1)(x2x7).\det(xI-M) = (x-3)(x+1)(x^2-5x+1)(x^2-x-7).

Every orbit character is orthogonal to constants. Therefore

L=5+212,4<L<5,L=\frac{5+\sqrt{21}}2,\qquad 4<L<5,

is a nontrivial full-graph eigenvalue, and

λ2(P6(3))L.(2)\lambda_2(\mathcal P_6(3))\ge L. \tag{2}

The conjectured equitable quotient records the color and position of one distinguished symbol. Its Fourier blocks are

Bt=(000020004)+t(111110100),t{2,1,1,2}.B_t = \begin{pmatrix}0&0&0\\0&2&0\\0&0&4\end{pmatrix} + t\begin{pmatrix}1&1&1\\1&1&0\\1&0&0\end{pmatrix}, \qquad t\in\{2,1,-1,-2\}.

For t=2t=2,

det(xIB2)=x(x4)(x6),\det(xI-B_2)=x(x-4)(x-6),

so its nontrivial eigenvalues are 00 and 44.

For the other three blocks, use L25L+1=0L^2-5L+1=0. The successive leading principal minors of LIBtLI-B_t are

tΔ1Δ2Δ31L1L+1L21L+15L3L+82L+27L5132L.\begin{array}{c|ccc} t&\Delta_1&\Delta_2&\Delta_3\\ \hline 1&L-1&L+1&L-2\\ -1&L+1&5L-3&L+8\\ -2&L+2&7L-5&13-2L. \end{array}

All entries are strictly positive because 4<L<54<L<5. Sylvester's criterion therefore shows that every eigenvalue of these blocks is strictly less than LL. Consequently

λ2(Q(P6,3))<5+212λ2(P6(3)).\boxed{ \lambda_2\bigl(Q(\mathfrak P_{6,3})\bigr) < \frac{5+\sqrt{21}}2 \le \lambda_2\bigl(\mathcal P_6(3)\bigr). }

Since both graphs have top eigenvalue 66,

6λ2(P6(3))<6λ2(Q(P6,3)).6-\lambda_2\bigl(\mathcal P_6(3)\bigr) < 6-\lambda_2\bigl(Q(\mathfrak P_{6,3})\bigr).

The proposed spectral-gap equality is therefore false.

0 endorsements
Shivam Patel ·