Effective black-box constructive recognition of classical groups.
From MaRDI portal
Recommendations
- Fast Constructive Recognition of Black-Box Unitary Groups
- Fast constructive recognition of black box orthogonal groups.
- Constructive recognition of classical groups in their natural representation.
- Constructive membership testing in black-box classical groups.
- Fast constructive recognition of black box symplectic groups.
- Constructive recognition algorithms of classical groups in GAP
- Constructive recognition of classical groups in even characteristic.
- scientific article; zbMATH DE number 1004941
- scientific article; zbMATH DE number 1004932
- Recognising simplicity of black-box groups by constructing involutions and their centralisers.
Cites work
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- scientific article; zbMATH DE number 54047 (Why is no real title available?)
- scientific article; zbMATH DE number 1111401 (Why is no real title available?)
- scientific article; zbMATH DE number 1749060 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- A Recognition Algorithm For Classical Groups Over Finite Fields
- A practical model for computation with matrix groups.
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- An improved method for generating the centralizer of an involution
- Black box classical groups.
- Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- Constructive membership testing in black-box classical groups.
- Constructive recognition of \(\text{SL}_3(q)\).
- Constructive recognition of classical groups in even characteristic.
- Constructive recognition of classical groups in odd characteristic.
- Constructive recognition of ๐๐๐ฟ(2,๐)
- ESTIMATION AND COMPUTATION WITH MATRICES OVER FINITE FIELDS
- Estimating proportions of elements in finite groups of Lie type.
- Fast Constructive Recognition of Black-Box Unitary Groups
- Fast constructive recognition of black box orthogonal groups.
- Fast constructive recognition of black box symplectic groups.
- Finding involutions in finite Lie type groups of odd characteristic.
- Generating random elements of a finite group
- Generation of finite classical groups by pairs of elements with large fixed point spaces.
- Involutions in Chevalley groups over fields of even order
- Linear algebraic groups and finite groups of Lie type.
- On constructive recognition of a black box \(\text{PSL}(d,q)\).
- On the minimal degrees of projective representations of the finite Chevalley groups
- On the number of \(p\)-regular elements in finite simple groups.
- Presentations of finite simple groups: a quantitative approach.
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
- Random walks on finite groups with few random generators
- Recognising simplicity of black-box groups by constructing involutions and their centralisers.
- Taking roots over high extensions of finite fields
- The Magma algebra system. I: The user language
- The probability of generating a finite classical group
- The probability of generating a finite simple group.
Cited in
(19)- A note on involution centralizers in black box groups
- Constructive recognition of classical groups in even characteristic.
- Strong involutions in finite special linear groups of odd characteristic
- Recognition of finite exceptional groups of Lie type.
- Fast constructive recognition of black box symplectic groups.
- Constructive recognition of classical groups in their natural representation.
- Presentations on standard generators for classical groups
- Constructive membership in black-box groups
- Fast constructive recognition of black box orthogonal groups.
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- Constructive membership testing in black-box classical groups.
- Constructing composition factors for a linear group in polynomial time
- Calculating subgroups with GAP
- Constructive recognition of classical groups in odd characteristic.
- Lengths of involutions in finite Coxeter groups
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Computing generators of groups preserving a bilinear form over residue class rings.
- Black box classical groups.
- Fast Constructive Recognition of Black-Box Unitary Groups
This page was built for publication: Effective black-box constructive recognition of classical groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468719)
