The computational matrix group project.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1981751
- scientific article; zbMATH DE number 6159604
- scientific article; zbMATH DE number 961607
- Matrix computations.
- scientific article; zbMATH DE number 635680
- scientific article; zbMATH DE number 5976624
- Computational group theory.
- A practical model for computation with matrix groups.
- Computing matrix representations
- Complexity and computation in matrix groups.
Cited in
(48)- The average number of cycles.
- Constructive recognition of classical groups in their natural representation.
- Computing finite semigroups
- Linear groups and computation
- Fast recognition of alternating groups of unknown degree.
- Minimal and random generation of permutation and matrix groups.
- Recognising the Suzuki groups in their natural representations.
- A computer-assisted analysis of some matrix groups.
- Representations, commutative algebra, and Hurwitz groups.
- Fast constructive recognition of black box orthogonal groups.
- Writing projective representations over subfields.
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
- Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
- Nearly simple matrix groups: desiderata and suggestions
- Complexity and computation in matrix groups.
- Black box exceptional groups of Lie type.
- THE ANDREWS–CURTIS CONJECTURE AND BLACK BOX GROUPS
- Computing a chief series and the soluble radical of a matrix group over a finite field.
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- Computing with matrix groups over infinite fields.
- CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS
- Presentations of finite simple groups: a quantitative approach.
- Recognising the small Ree groups in their natural representations.
- scientific article; zbMATH DE number 1243197 (Why is no real title available?)
- scientific article; zbMATH DE number 1981751 (Why is no real title available?)
- A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
- Black box exceptional groups of Lie type. II.
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- A practical model for computation with matrix groups.
- Computing in groups of Lie type
- Constructive membership tests in some infinite matrix groups
- CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
- Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
- Algorithmic methods for finitely generated Abelian groups
- On a variant of the product replacement algorithm
- 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
- On the semidirect discrete logarithm problem in finite groups
- Computational group theory: bedrock and new frontiers
- On the complexity of the relative eigenvector problem
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- Large element orders and the characteristic of Lie-type simple groups.
- On the complexity, tractability and group theoretic applications of the relative eigenvector problem
- Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules.
- Computer construction of split Cartan subalgebras
- Identification of matrix generators of a Chevalley group.
This page was built for publication: The computational matrix group project.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759632)
