SearcharxivSearch

arXiv · 0708.3664

Commutator maps, measure preservation, and T-systems

Abstract

Let G be a finite simple group. We show that the commutator map $a : G \times G \to G$ is almost equidistributed as the order of G goes to infinity. This somewhat surprising result has many applications. It shows that for a subset X of G we have $a^{-1}(X)/|G|^2 = |X|/|G| + o(1)$, namely $a$ is almost measure preserving. From this we deduce that almost all elements $g \in G$ can be expressed as commutators $g = [x,y]$ where x,y generate G. This enables us to solve some open problems regarding T-systems and the Product Replacement Algorithm (PRA) graph. We show that the number of T-systems in G with two generators tends to infinity as the order of G goes to infinity. This settles a conjecture of Guralnick and Pak. A similar result follows for the number of connected components of the PRA graph of G with two generators. Some of our results apply for more general finite groups, and more general word maps. Our methods are based on representation theory, combining classical character theory with recent results on character degrees and values in finite simple groups. In particular the so called Witten zeta function plays a key role in the proofs.

Explore related subjects

Keep this discovery

BibTeXRIS

Shelly Garion, Aner Shalev. 2007-08-27. Commutator maps, measure preservation, and T-systems. https://doi.org/10.1090/s0002-9947-09-04575-9

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR