scientific article; zbMATH DE number 1981751
From MaRDI portal
Publication:4426040
constructive recognitionLas Vegas type algorithmsmatrix groupspolynomial time algorithmspresentationssimple groups
Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: alternating groups and groups of Lie type (20D06) Generators, relations, and presentations of groups (20F05) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(26)- Computing the order of centralizers in linear groups
- Recognising the Suzuki groups in their natural representations.
- A computer-assisted analysis of some matrix groups.
- Fast constructive recognition of black box orthogonal groups.
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
- The computational matrix group project.
- Nearly simple matrix groups: desiderata and suggestions
- Complexity and computation in matrix groups.
- Biased tadpoles: a fast algorithm for centralizers in large matrix groups
- Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- scientific article; zbMATH DE number 5155385 (Why is no real title available?)
- Presentations of finite simple groups: a quantitative approach.
- Computing matrix representations
- scientific article; zbMATH DE number 1254259 (Why is no real title available?)
- scientific article; zbMATH DE number 1284153 (Why is no real title available?)
- scientific article; zbMATH DE number 1302483 (Why is no real title available?)
- scientific article; zbMATH DE number 475364 (Why is no real title available?)
- scientific article; zbMATH DE number 1004929 (Why is no real title available?)
- A practical model for computation with matrix groups.
- Polynomial-time theory of matrix groups
- Presentations of finite simple groups: a computational approach.
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- An algorithm for Lang's theorem.
- Computer construction of split Cartan subalgebras
- Identification of matrix generators of a Chevalley group.
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 Q4426040)