Constructive recognition of classical groups in odd characteristic.
From MaRDI portal
Publication:731248
DOI10.1016/J.JALGEBRA.2009.04.028zbMATH Open1181.20044OpenAlexW4213216172MaRDI QIDQ731248FDOQ731248
Authors: E. A. O'Brien, C. R. Leedham-Green 
Publication date: 2 October 2009
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2009.04.028
Recommendations
- Constructive recognition of classical groups in even characteristic.
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Constructive recognition of classical groups in their natural representation.
- Effective black-box constructive recognition of classical groups.
- scientific article; zbMATH DE number 1004930
Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Endliche Gruppen I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Writing projective representations over subfields.
- Title not available (Why is that?)
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- The probability of generating a finite simple group
- Generating random elements of a finite group
- Title not available (Why is that?)
- An improved method for generating the centralizer of an involution
- Constructive membership in black-box groups
- Recognising the Suzuki groups in their natural representations.
- Title not available (Why is that?)
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Constructive recognition of ๐๐๐ฟ(2,๐)
- Finding involutions in finite Lie type groups of odd characteristic.
- On the spinor norm
- Constructive recognition of classical groups in their natural representation.
- Constructive recognition of \(\text{SL}_3(q)\).
- Fast constructive recognition of black box orthogonal groups.
- Black box classical groups.
- On constructive recognition of a black box \(\text{PSL}(d,q)\).
- Fast recognition of classical groups over large fields
- Fast Constructive Recognition of Black-Box Unitary Groups
- Nearly Optimal Algorithms for Canonical Matrix Forms
- Title not available (Why is that?)
- Towards effective algorithms for linear groups.
- Fast algorithms for the characteristic polynomial
- Tensor products are projective geometries
- Title not available (Why is that?)
Cited In (26)
- Constructive recognition of classical groups in even characteristic.
- Recognising simplicity of black-box groups by constructing involutions and their centralisers.
- Recognising the small Ree groups in their natural representations.
- Constructive Sylow theorems for the classical groups.
- Recognition of finite exceptional groups of Lie type.
- On proportions of pre-involutions in finite classical groups.
- Regular semisimple elements and involutions in finite general linear groups of odd characteristic.
- Constructive homomorphisms for classical groups.
- Large element orders and the characteristic of Lie-type simple groups.
- Estimating proportions of elements in finite groups of Lie type.
- A new method for recognising Suzuki groups
- Probabilistic generation of finite classical groups in odd characteristic by involutions.
- A practical model for computation with matrix groups.
- On the twisted modules for finite matrix groups
- Gaussian elimination in split unitary groups with an application to public-key cryptography
- Proportions of elements with given 2-part order in finite classical groups of odd characteristic.
- Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\)
- Effective black-box constructive recognition of classical groups.
- Presentations of finite simple groups: a computational approach.
- Involution centralisers in finite unitary groups of odd characteristic
- Showcasing straight-line programs with memory via matrix Bruhat decomposition
- The product replacement prospector.
- Strong involutions in finite special linear groups of odd characteristic
- Constructive membership testing in black-box classical groups.
- Presentations on standard generators for classical groups
- On generating coset representatives of \(\mathrm{PGL}_2(\mathbb F_q)\) in \(\mathrm{PGL}_2(\mathbb F_{q^2})\)
Uses Software
This page was built for publication: Constructive recognition of classical groups in odd characteristic.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731248)
