Representation and abelianization growth, particularly along expanding sequences

arXiv:2610.37399 · math.GR, math.CO, math.RT · Submitted 2026-10-27 · Read on arXiv

math.GR, math.CO, math.RT

Submitted: 2026-10-27

Updated: 2026-10-27

License: http://creativecommons.org/licenses/by/4.0/

The gist: We study two obstructions to a finite group G having a generating d-tuple whose Cayley graph has spectral gap at least ε.

Abstract

We study two obstructions to a finite group G having a generating d-tuple whose Cayley graph has spectral gap at least ε. Lubotzky and Weiss proved that such a gap forces ab k(G), the largest order of the abelianization of a subgroup of index at most k, to be (O ε(dk)), while de la Harpe, Robertson and Valette proved that it forces rep k(G), the number of irreducible complex representations of degree at most k, to be (O ε(dk 2)). We show that the first bound implies the second, and in fact implies it with k squared replaced by k k. For this, we prove that every finite d-generated group satisfies the inequality rep k(G) at most ((d-1)k k+O(dk)) times ab k(G), regardless of its spectral gap. The leading term (d-1)k k is attained by powers of alternating groups, and it disappears for groups without large alternating sections. The proof reduces to counting the finite primitive subgroups of GL m(C), and we show that there are at most (O(4m)) of them up to conjugacy and scalars. Wigderson asked whether k squared in the second bound can be lowered to k, so our result answers his question up to a logarithm. We do not know whether the logarithm is actually needed. For powers of alternating groups, the natural candidates, we show that a spectral gap keeps the number of factors a fixed power below the maximum allowed by d-generation, and that random generators have spectral gap tending to 0 already for superpolynomially many factors.

Related papers