Cited in
(23)- The use of permutation representations in structural computations in large finite matrix groups
- Generation of finite classical groups by pairs of elements with large fixed point spaces.
- Elements in finite classical groups whose powers have large 1-eigenspaces.
- Computing conjugacy classes of elements in matrix groups.
- Towards efficient normalizers of primitive groups
- Algorithms for Experimenting with Zariski Dense Subgroups
- A practical model for computation with matrix groups.
- A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
- Zariski density and computing in arithmetic groups
- kbmag
- MeatAxe
- matrixss
- orb
- Nilmat
- Polenta
- PCQL
- AClib
- Cryst
- matgrp
- The strong approximation theorem and computing with linear groups
- Finite primitive groups and regular orbits of group elements
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- Linear groups and computation
This page was built for software: recog
