Random Generation of Simple Groups by Two Conjugate Elements
From MaRDI portal
Publication:4399264
DOI10.1112/S002460939700338XzbMATH Open0904.20020WikidataQ129864582 ScholiaQ129864582MaRDI QIDQ4399264FDOQ4399264
Authors: Aner Shalev
Publication date: 22 November 1998
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Recommendations
Generators, relations, and presentations of groups (20F05) Finite simple groups and their classification (20D05) Subgroup theorems; subgroup growth (20E07) Maximal subgroups (20E28) Probabilistic methods in group theory (20P05)
Cited In (17)
- RANDOM (r, s)-GENERATION OF FINITE CLASSICAL GROUPS
- On the Random Generation of Finite Simple Classical Groups
- Zero-one generation laws for finite simple groups
- Probabilistic Generation of Wreath Products of Non-abelian Finite Simple Groups
- Simple groups, permutation groups, and probability
- Probabilistic generation of finite simple groups. II.
- Classical groups, probabilistic methods, and the \((2,3)\)-generation problem
- A theorem on random matrices and some applications
- The probability of generating a finite soluble group.
- Probabilistic generation of finite simple groups
- Mixing and generation in simple groups.
- Random generation of finite simple groups by \(p\)-regular or \(p\)-singular elements
- Random generation with cycle type restrictions
- Random generation of finite simple groups
- Almost independence and irreducibility in simple finite and algebraic groups
- Dixon's asymptotic without the classification of finite simple groups
- The probability of generating a finite classical group
This page was built for publication: Random Generation of Simple Groups by Two Conjugate Elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399264)