Refined non-Abelian dominance hypothesis for graph automorphism groups

Let G\mathcal{G} be a graph on nn vertices with non-abelian automorphism group G=Aut(G)G=\operatorname{Aut}(\mathcal{G}) of order nn, and let x\mathbf{x} be a single observation of a graph-filtered signal. Refined non-Abelian dominance hypothesis. The group GG achieves strictly higher expected single-observation spectral concentration than every conjugated cyclic group precisely when (i) the graph-filtered covariance has an eigenspace of dimension d>1d>1 carrying an irreducible representation of GG of the same dimension, and (ii) the dominant eigenvalue is non-degenerate:

E[ψ(G,x)]>E[maxUψ(UHZnU,x)].E[\psi(G,\mathbf{x})]>E\left[\max_{\mathbf{U}}\psi(\mathbf{U}^{H}\mathbb{Z}_n\mathbf{U},\mathbf{x})\right].

Here the comparison is the one stated in the hypothesis, with the maximum taken over the unitary conjugates of Zn\mathbb{Z}_n. The supplied text gives no evidence that this characterization has been resolved.

Sources & referencesView supporting material

Primary source

Mitchell A. Thornton, “Algebraic Diversity: Group-Theoretic Spectral Estimation from Single Observations”, arXiv:2604.03634 (2026).

Progress summary

Refreshed
Claimed solved

A proposed counterexample claims to disprove the hypothesis, but no independent verification has appeared.

The hypothesis asserts that two spectral conditions exactly characterize when a non-Abelian graph automorphism group beats all conjugated cyclic competitors. Thornton’s 2026 paper develops the surrounding framework, but its abstract does not claim to settle this exact characterization.

Posted attempt

A complete disproof is claimed using a six-vertex graph with automorphism group S3S_3: the proposed construction satisfies both spectral conditions, yet the unrestricted cyclic comparison has value 11 for every nonzero observation while the S3S_3 concentration is almost surely less than 11. The argument has not been independently verified.

Current status (as of August 2026): The hypothesis has a detailed but unverified counterexample claim; no verified proof or disproof is recorded, so the mathematical question remains unsettled.

Sources

Solutions 1

Counterexample

The refined non-Abelian dominance hypothesis is false, including when both of its spectral conditions hold. We use the definitions in Thornton, Conjecture 33 (Conjecture 23 in the original version).

The unitary maximum

For a finite group KK of unitary matrices and a nonzero vector xx, write

FK(x)=1KQKQxxQ,F_K(x)=\frac{1}{|K|}\sum_{Q\in K}Qxx^*Q^*, ψ(K,x)=λmax(FK(x))trFK(x).\psi(K,x)=\frac{\lambda_{\max}(F_K(x))}{\operatorname{tr}F_K(x)}.

These are the source's group-averaged estimator and spectral concentration. Each summand is positive semidefinite and has trace x2\|x\|^2, so 0ψ(K,x)10\leq\psi(K,x)\leq1.

Let Cn\mathcal C_n be the group of cyclic coordinate shifts, and put CU=UCnU\mathcal C_U=U^*\mathcal C_nU. Every element of Cn\mathcal C_n fixes the unit vector e=(1,,1)T/ne=(1,\ldots,1)^{\mathsf T}/\sqrt n. Choose a unitary UU satisfying Ux=xeUx=\|x\|e. Such a unitary exists by extending the two unit vectors to orthonormal bases. Every element of CU\mathcal C_U then fixes xx. Consequently FCU(x)=xxF_{\mathcal C_U}(x)=xx^* and ψ(CU,x)=1\psi(\mathcal C_U,x)=1. Thus, for every nonzero xx,

maxUU(n)ψ(CU,x)=1.(1)\max_{U\in\mathrm U(n)}\psi(\mathcal C_U,x)=1. \tag{1}

The source explicitly takes this unrestricted maximum inside the expectation. In particular, the optimizing unitary in (1) is allowed to depend on xx.

A graph satisfying both spectral conditions

Take the complete graph on vertices 0,1,2,30,1,2,3, and attach the path 0,4,50,4,5, adding the edges 0404 and 4545. This is a connected simple graph on six vertices. Its degrees, in this order, are 4,3,3,3,2,14,3,3,3,2,1. Every automorphism fixes 0,4,50,4,5, while all permutations of 1,2,31,2,3 are automorphisms. Hence

G=Aut(G)S3,G=6.G=\operatorname{Aut}(\mathcal G)\cong S_3, \qquad |G|=6.

Let AA be its adjacency matrix and choose the polynomial graph filter

h(t)=1+t5,H=h(A),R=H2.h(t)=1+\frac{t}{5},\qquad H=h(A),\qquad R=H^2.

Take independent w,ηCN(0,I6)w,\eta\sim\mathcal{CN}(0,I_6) and set x=Hw+ηx=Hw+\eta. This has exactly the source's adjacency-polynomial signal form, with independent white noise. The signal covariance is RR, and the observation covariance is R+I6R+I_6.

Let WW be the two-dimensional subspace of vectors vanishing at 0,4,50,4,5 whose coordinates at 1,2,31,2,3 sum to zero. We claim

ker(A+I6)=W.(2)\ker(A+I_6)=W. \tag{2}

Indeed, if (A+I6)y=0(A+I_6)y=0, the rows at 1,2,31,2,3 give y0+y1+y2+y3=0y_0+y_1+y_2+y_3=0. The row at 00 then gives y4=0y_4=0, the row at 55 gives y5=0y_5=0, and the row at 44 gives y0=0y_0=0. Conversely, every vector in WW satisfies the equations.

The action of GG on WW is irreducible over C\mathbb C. To see this directly, take any nonzero vector in a nonzero invariant subspace of WW. Two of its coordinates among 1,2,31,2,3 differ. Subtracting its image under the transposition of these coordinates gives a nonzero multiple of a coordinate difference. Permuting the coordinates then gives all coordinate differences, which span WW.

All eigenvalues of AA lie in [4,4][-4,4], since the maximum degree is four. Therefore HH is positive definite, and the function λ(1+λ/5)2\lambda\mapsto(1+\lambda/5)^2 is strictly increasing on the adjacency spectrum. By (2), the eigenspace of RR at 16/2516/25 is exactly WW. This proves condition (i): it is a two-dimensional eigenspace carrying a two-dimensional irreducible representation of GG.

The Perron--Frobenius theorem applies because AA is nonnegative and the graph is connected, so its largest eigenvalue is simple. Strict monotonicity of the same function shows that the largest eigenvalue of RR is simple as well. This proves condition (ii). Adding the white-noise covariance I6I_6 only shifts eigenvalues, so both conditions also hold for R+I6R+I_6.

The comparison is reversed

The observation is a nondegenerate complex Gaussian. Thus x00x_0\neq0 and x1x2x_1\neq x_2 with probability one. For such an xx, the vectors xx and (12)x(1\,2)x are linearly independent: proportionality would have scalar one by their common nonzero coordinate at 00, contradicting x1x2x_1\neq x_2.

Both corresponding rank-one matrices occur with positive coefficient in FG(x)F_G(x). Hence FG(x)F_G(x) has rank at least two almost surely, and therefore ψ(G,x)<1\psi(G,x)<1 almost surely. Together with (1), this gives

E[ψ(G,x)]<1,\mathbb E[\psi(G,x)]<1, E ⁣[maxUU(6)ψ(CU,x)]=1.\mathbb E\!\left[\max_{U\in\mathrm U(6)} \psi(\mathcal C_U,x)\right]=1.

Both spectral hypotheses are satisfied, but the conjectured strict dominance fails.

0 endorsements
Shivam Patel ·