Connectivity of the product replacement algorithm graph of PSL(2, q)

DOI10.1515/JGT.2008.048zbMath1162.20047arXiv0712.1357OpenAlexW2143349668MaRDI QIDQ3544293

Shelly Garion

Publication date: 5 December 2008

Published in: Journal of Group Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.1357

zbMATH Keywords

random walksrandom elementsfinite simple groups of Lie typeproduct replacement algorithmrandom generators

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Sums of independent random variables; random walks (60G50) Linear algebraic groups over finite fields (20G40) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Probabilistic methods in group theory (20P05)

Related Items (4)

New Upper Bounds On The Spreads of the Sporadic Simple Groups ⋮ A zero-one law for random subgroups of some totally disconnected groups ⋮ Nonabelian level structures, Nielsen equivalence, and Markoff triples ⋮ Application of character estimates to the number of \(\mathrm{T}_2\)-systems of the alternating group

Cites Work

• On the maximal subgroups of the finite classical groups
• Expansion of product replacement graphs
• Two-generator groups. I
• Probabilistic generation of finite simple groups
• On the maximal size of independent generating sets of \(\text{PSL}_2(q)\)
• The product replacement algorithm and Kazhdan’s property (T)
• Finite Quotients of the Automorphism Group of a Free Group
• On a question of B. H. Neumann
• Generating random elements of a finite group
• T-systems of certain finite simple groups
• On T-systems of groups
• Zwei Klassen charakteristischer Untergruppen und ihre Faktorgruppen

This page was built for publication: Connectivity of the product replacement algorithm graph of PSL(2, q)