Refined non-Abelian dominance hypothesis for graph automorphism groups
Refined non-Abelian dominance hypothesis for graph automorphism groups
Let be a graph on vertices with non-abelian automorphism group of order , and let be a single observation of a graph-filtered signal. Refined non-Abelian dominance hypothesis. The group 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 carrying an irreducible representation of of the same dimension, and (ii) the dominant eigenvalue is non-degenerate:
Here the comparison is the one stated in the hypothesis, with the maximum taken over the unitary conjugates of . 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
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 : the proposed construction satisfies both spectral conditions, yet the unrestricted cyclic comparison has value for every nonzero observation while the concentration is almost surely less than . 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
Sign in to submit a solution.
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 of unitary matrices and a nonzero vector , write
These are the source's group-averaged estimator and spectral concentration. Each summand is positive semidefinite and has trace , so .
Let be the group of cyclic coordinate shifts, and put . Every element of fixes the unit vector . Choose a unitary satisfying . Such a unitary exists by extending the two unit vectors to orthonormal bases. Every element of then fixes . Consequently and . Thus, for every nonzero ,
The source explicitly takes this unrestricted maximum inside the expectation. In particular, the optimizing unitary in (1) is allowed to depend on .
A graph satisfying both spectral conditions
Take the complete graph on vertices , and attach the path , adding the edges and . This is a connected simple graph on six vertices. Its degrees, in this order, are . Every automorphism fixes , while all permutations of are automorphisms. Hence
Let be its adjacency matrix and choose the polynomial graph filter
Take independent and set . This has exactly the source's adjacency-polynomial signal form, with independent white noise. The signal covariance is , and the observation covariance is .
Let be the two-dimensional subspace of vectors vanishing at whose coordinates at sum to zero. We claim
Indeed, if , the rows at give . The row at then gives , the row at gives , and the row at gives . Conversely, every vector in satisfies the equations.
The action of on is irreducible over . To see this directly, take any nonzero vector in a nonzero invariant subspace of . Two of its coordinates among 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 .
All eigenvalues of lie in , since the maximum degree is four. Therefore is positive definite, and the function is strictly increasing on the adjacency spectrum. By (2), the eigenspace of at is exactly . This proves condition (i): it is a two-dimensional eigenspace carrying a two-dimensional irreducible representation of .
The Perron--Frobenius theorem applies because 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 is simple as well. This proves condition (ii). Adding the white-noise covariance only shifts eigenvalues, so both conditions also hold for .
The comparison is reversed
The observation is a nondegenerate complex Gaussian. Thus and with probability one. For such an , the vectors and are linearly independent: proportionality would have scalar one by their common nonzero coordinate at , contradicting .
Both corresponding rank-one matrices occur with positive coefficient in . Hence has rank at least two almost surely, and therefore almost surely. Together with (1), this gives
Both spectral hypotheses are satisfied, but the conjectured strict dominance fails.