A Recognition Algorithm For Classical Groups Over Finite Fields
From MaRDI portal
Recommendations
Cited in
(56)- Prime power graphs for groups of Lie type
- Tensor products are projective geometries
- On finite groups satisfying the permutizer condition
- Constructive recognition of classical groups in their natural representation.
- Strong involutions in finite special linear groups of odd characteristic
- Testing matrix groups for primitivity
- Transitive subgroups of primitive permutation groups
- Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
- On flag-transitive 2-(v,k,2) designs
- Abelian quotients and orbit sizes of linear groups
- Pairwise transitive 2-designs
- Constructive recognition of classical groups in even characteristic.
- A computer-assisted analysis of some matrix groups.
- Representations, commutative algebra, and Hurwitz groups.
- Probabilistic recognition of orthogonal and symplectic groups
- Fast recognition of classical groups over large fields
- Random matrix theory over finite fields
- Constructive recognition algorithms of classical groups in GAP
- Complexity and computation in matrix groups.
- Algorithms to identify abundant p-singular elements in finite classical groups.
- Prime divisors in polynomial orbits over function fields
- Primitive prime divisors and the nth cyclotomic polynomial
- Computing a chief series and the soluble radical of a matrix group over a finite field.
- On the number of \(p\)-regular elements in finite simple groups.
- On intersections of classical groups
- Constructive membership in black-box groups
- Certain classical groups are not well-defined
- MINIMAL IRREDUCIBILITY AND THE UNIPOTENT CHARACTERS OF GROUPS OF TYPE Bm AND Cm
- A Recognition Algorithm for Special Linear Groups
- Abundant \(p\)-singular elements in finite classical groups.
- Invariable generation and the Chebotarev invariant of a finite group.
- Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs
- Primitive prime divisor elements in finite classical groups
- scientific article; zbMATH DE number 1004930 (Why is no real title available?)
- scientific article; zbMATH DE number 1004941 (Why is no real title available?)
- Intersecting two classical groups.
- Effective black-box constructive recognition of classical groups.
- scientific article; zbMATH DE number 1370596 (Why is no real title available?)
- 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
- A practical model for computation with matrix groups.
- Fast Constructive Recognition of Black-Box Unitary Groups
- Elements in finite classical groups whose powers have large 1-eigenspaces.
- Gaussian elimination in split unitary groups with an application to public-key cryptography
- Determining Aschbacher classes using characters.
- An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
- Transitive decompositions of graph products: rank 3 grid type
- Towards effective algorithms for linear groups.
- Random generation of finite simple groups by p-regular or p-singular elements
- On locally n n grid graphs
- Computational group theory: bedrock and new frontiers
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- Large element orders and the characteristic of Lie-type simple groups.
- Constructive recognition of classical groups in odd characteristic.
- Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules.
- Estimating proportions of elements in finite groups of Lie type.
This page was built for publication: A Recognition Algorithm For Classical Groups Over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354309)
