Connectivity of the product replacement graph of simple groups of bounded Lie rank.

DOI10.1016/j.jalgebra.2008.03.005zbMath1158.20040arXiv0710.0437OpenAlexW2026221286WikidataQ115351384 ScholiaQ115351384MaRDI QIDQ947505

Shelly Garion, Nir Avni

Publication date: 6 October 2008

Published in: Journal of Algebra (Search for Journal in Brave)

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

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) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Probabilistic methods in group theory (20P05)

Related Items

A zero-one law for random subgroups of some totally disconnected groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a question of Gaschütz
• Expansion of product replacement graphs
• \(T_ 3\)-systems of finite simple groups
• Zu einem von B. H. und H. Neumann gestellten Problem
• Commutator maps, measure preservation, and 𝑇-systems
• 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