A method for building permutation representations of finitely presented groups
Gabriele Nebe, Richard Parker, and Sarah Rees
Keywords
finitely presented groups; computational methods; permutation representation
Status
Published in Proceedings of Finite Simple Groups: Thirty Years of the Atlas and Beyond, Princeton 2015.
Abstract
We design an algorithm to find
certain partial permutation representations of a finitely
presented group $G$ (the bricks) that may be combined
to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.
The preprint is available as a gzipped
pdf file.
Alternatively, you can request a copy by
e-mailing me.