The Schreier-Sims algorithm for matrix groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
The author's MSc thesis. Uses AMS-LaTeX and algorithm2e.sty. For the associated source code, see http://matrixss.sourceforge.net/

Keywords

Group Theory, Data Structures and Algorithms, 20-04, 20G40, 20H30 (Primary) 68Q25, 68W20, 20B40 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/73031

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0410593
 http://arxiv.org/abs/math/0410593

Collections

arXiv