scientific article; zbMATH DE number 1004941
From MaRDI portal
Publication:4335304
Recommendations
Cited in
(19)- Deciding finiteness for matrix groups over function fields
- Prime power graphs for groups of Lie type
- Constructive recognition of classical groups in their natural representation.
- Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
- Probabilistic recognition of orthogonal and symplectic groups
- Fast recognition of classical groups over large fields
- Constructive recognition algorithms of classical groups in GAP
- Biased tadpoles: a fast algorithm for centralizers in large matrix groups
- Algorithms to identify abundant p-singular elements in finite classical groups.
- Certain classical groups are not well-defined
- A Recognition Algorithm for Special Linear Groups
- Abundant \(p\)-singular elements in finite classical groups.
- Algorithmic Recognition of Group Actions on Orbitals
- scientific article; zbMATH DE number 1004930 (Why is no real title available?)
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Effective black-box constructive recognition of classical groups.
- scientific article; zbMATH DE number 1370596 (Why is no real title available?)
- An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4335304)