TY - JOUR
T1 - Commutator maps, measure preservation, and T-systems
AU - Garion, Shelly
AU - Shalev, Aner
PY - 2009/9
Y1 - 2009/9
N2 - Let G be a finite simple group. We show that the commutator map α: G × G → G is almost equidistributed as |G| → ∞. This somewhat surprising result has many applications. It shows that a for a subset X ⊆ G we have α-1 (X)/|G|2 = |X|/|G| +o(1), namely α is almost measure preserving. From this we deduce that almost all elements g ∈ 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 |G| → ∞. 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 ζG (s) = ΣX∈Irr(G) X(1)-s plays a key role in the proofs.
AB - Let G be a finite simple group. We show that the commutator map α: G × G → G is almost equidistributed as |G| → ∞. This somewhat surprising result has many applications. It shows that a for a subset X ⊆ G we have α-1 (X)/|G|2 = |X|/|G| +o(1), namely α is almost measure preserving. From this we deduce that almost all elements g ∈ 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 |G| → ∞. 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 ζG (s) = ΣX∈Irr(G) X(1)-s plays a key role in the proofs.
UR - http://www.scopus.com/inward/record.url?scp=72149134266&partnerID=8YFLogxK
U2 - 10.1090/S0002-9947-09-04575-9
DO - 10.1090/S0002-9947-09-04575-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:72149134266
SN - 0002-9947
VL - 361
SP - 4631
EP - 4651
JO - Transactions of the American Mathematical Society
JF - Transactions of the American Mathematical Society
IS - 9
ER -