Generation of almost simple groups
From MaRDI portal
Publication:1904076
DOI10.1006/JABR.1995.1345zbMATH Open0839.20021OpenAlexW1983764954MaRDI QIDQ1904076FDOQ1904076
Authors: Francesca Dalla Volta, Andrea Lucchini
Publication date: 10 June 1996
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jabr.1995.1345
Recommendations
minimal number of generatorspresentation rankfinite non-abelian simple groupfinite almost simple group
Generators, relations, and presentations of groups (20F05) Finite simple groups and their classification (20D05)
Cited In (30)
- On the probability of generating a monolithic group.
- Generation of simple groups
- Generators and minimal normal subgroups
- Generation and random generation: from simple groups to maximal subgroups.
- Every finite non-solvable group admits an oriented regular representation
- Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time
- Maximal subgroups in finite and profinite groups
- Generating wreath products and their augmentation ideals
- Generation of classical groups
- On the uniform spread of almost simple symplectic and orthogonal groups
- GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
- Two-closure of rank \(3\) groups in polynomial time
- Probabilistic generation of finite almost simple groups
- Recognizing the prime divisors of the index of a proper subgroup.
- Probabilistic and Asymptotic Aspects of Finite Simple Groups
- GENERATION OF SECOND MAXIMAL SUBGROUPS AND THE EXISTENCE OF SPECIAL PRIMES
- The probability of generating a finite simple group.
- Title not available (Why is that?)
- Generation of finite almost simple groups by conjugates.
- Generators for finite groups with a unique minimal normal subgroup
- Presentations of finite simple groups: a computational approach.
- Boundedly generated subgroups of finite groups.
- On Cayley representations of central Cayley graphs over almost simple groups
- Title not available (Why is that?)
- The size of a minimal generating set for primitive \(\frac{3}{2} \)-transitive groups
- Minimal and random generation of permutation and matrix groups.
- Maximal subgroups of finite groups avoiding the elements of a generating set
- Finite groups with a large automorphism orbit
- Generating semisimple groups by tori
- Asymptotic results for primitive permutation groups and irreducible linear groups.
This page was built for publication: Generation of almost simple groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904076)