Constructive recognition of classical groups in odd characteristic.
From MaRDI portal
Let \(G=\langle X\rangle\leq\text{GL}(d,F)\) be a classical group in its natural representation defined over a finite field \(F\) of odd characteristic. The authors consider a `straight-line program' (SLP) for \(g\in G=\langle X\rangle\) as an efficiently stored group word on \(X\) that evaluates to \(g\). They present Las Vegas algorithms to construct standard generators for \(G\) which permit people to write an element of \(G\) as a straight-line program in \(X\). The algorithms run in polynomial-time, subject to the existence of a discrete logarithm oracle for \(F\).
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
Cites work
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- A Recognition Algorithm For Classical Groups Over Finite Fields
- An improved method for generating the centralizer of an involution
- Black box classical groups.
- Constructive membership in black-box groups
- Constructive recognition of \(\text{SL}_3(q)\).
- Constructive recognition of classical groups in their natural representation.
- Constructive recognition of ๐๐๐ฟ(2,๐)
- Endliche Gruppen I
- Fast algorithms for the characteristic polynomial
- Fast constructive recognition of black box orthogonal groups.
- Fast Constructive Recognition of Black-Box Unitary Groups
- Fast recognition of classical groups over large fields
- Finding involutions in finite Lie type groups of odd characteristic.
- Generating random elements of a finite group
- scientific article; zbMATH DE number 1187223 (Why is no real title available?)
- scientific article; zbMATH DE number 46141 (Why is no real title available?)
- scientific article; zbMATH DE number 54047 (Why is no real title available?)
- scientific article; zbMATH DE number 1004929 (Why is no real title available?)
- scientific article; zbMATH DE number 1111401 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 1370596 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 3360363 (Why is no real title available?)
- Nearly Optimal Algorithms for Canonical Matrix Forms
- On constructive recognition of a black box \(\text{PSL}(d,q)\).
- On the spinor norm
- Recognising the Suzuki groups in their natural representations.
- Tensor products are projective geometries
- The Magma algebra system. I: The user language
- The probability of generating a finite simple group
- Towards effective algorithms for linear groups.
- Writing projective representations over subfields.
Cited in
(27)- A new method for recognising Suzuki groups
- Strong involutions in finite special linear groups of odd characteristic
- Involution centralisers in finite unitary groups of odd characteristic
- Presentations on standard generators for classical groups
- Proportions of elements with given 2-part order in finite classical groups of odd characteristic.
- Constructive recognition of classical groups in even characteristic.
- Constructive Sylow theorems for the classical groups.
- Recognition of finite exceptional groups of Lie type.
- Regular semisimple elements and involutions in finite general linear groups of odd characteristic.
- Probabilistic generation of finite classical groups in odd characteristic by involutions.
- Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\)
- Recognising the small Ree groups in their natural representations.
- On the twisted modules for finite matrix groups
- Effective black-box constructive recognition of classical groups.
- A practical model for computation with matrix groups.
- Gaussian elimination in split unitary groups with an application to public-key cryptography
- On generating coset representatives of \(\mathrm{PGL}_2(\mathbb F_q)\) in \(\mathrm{PGL}_2(\mathbb F_{q^2})\)
- Constructive membership testing in black-box classical groups.
- Recognising simplicity of black-box groups by constructing involutions and their centralisers.
- On proportions of pre-involutions in finite classical groups.
- Presentations of finite simple groups: a computational approach.
- Constructive homomorphisms for classical groups.
- The product replacement prospector.
- Showcasing straight-line programs with memory via matrix Bruhat decomposition
- Bipartite q-Kneser graphs and two-generated irreducible linear groups
- Large element orders and the characteristic of Lie-type simple groups.
- Estimating proportions of elements in finite groups of Lie type.
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)
