Constructive membership in black-box groups
DOI10.1515/JGT.2008.047zbMath1173.20036OpenAlexW1976647207MaRDI QIDQ3544292
Petra E. Holmes, Robert A. Wilson, E. A. O'Brien, Stephen A. Linton, Alexander J. E. Ryba
Publication date: 5 December 2008
Published in: Journal of Group Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jgt.2008.047
Monte Carlo algorithmsrandom elementspolynomial time algorithmsfinite simple groups of Lie typeblack-box groupsconstructive membership problemgroup-theoretic algorithmsmatrix groups over finite fields
Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Representations of finite groups of Lie type (20C33) Probabilistic methods in group theory (20P05)
Related Items
Cites Work
- The Magma algebra system. I: The user language
- Fast Monte Carlo algorithms for permutation groups
- On the probability that a group element is \(p\)-singular
- The probability of generating a finite simple group
- Fast constructive recognition of black box orthogonal groups.
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Ru< E7(5)
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- Generating random elements of a finite group
- Finding the characteristic of a group of Lie type
- Constructive recognition of ๐๐๐ฟ(2,๐)