The Schreier-Sims algorithm for matrix groups
Henrik Bäärnhielm
Abstract
This is the report of a project with the aim to make a new implementation of the Schreier-Sims algorithm in GAP, specialized for matrix groups. The standard Schreier-Sims algorithm is described in some detail, followed by descriptions of the probabilistic Schreier-Sims algorithm and the Schreier-Todd-Coxeter-Sims algorithm. Then we discuss our implementation and some optimisations, and finally we report on the performance of our implementation, as compared to the existing implementation in GAP, and we give benchmark results. The conclusion is that our implementation in some cases is faster and consumes much less memory.
Create a lesson
Related papers
Invariant random subgroups of the finitary special linear group over a finite field
Noam Atar, Arie Levit
Vanishing-set inclusion and character degrees in finite p-groups
Zhi-Lin Zhang
Singular Loci of SL2(C)-Representation Varieties of Non-Hopfian Baumslag--Solitar Groups
S. Liriano
Finite groups with all involutions fused
Zheng Guo, Yan Zhou Zhu
A complete description of the algebraic structure of pseudocompact abelian groups
Dikran Dikranjan, Alejandro Dorantes-Aldama, Dmitri Shakhmatov
Constructing free subgroups of matrix groups
Emmanuel Breuillard, Bettina Eick, Tommy Hofmann et al.