Back to Search Start Over

The use of permutation representations in structural computations in large finite matrix groups

Authors :
Derek F. Holt
John Cannon
William R. Unger
Source :
Journal of Symbolic Computation. 95:26-38
Publication Year :
2019
Publisher :
Elsevier BV, 2019.

Abstract

We determine the minimal degree permutation representations of all finite groups with trivial soluble radical, and describe applications to structural computations in large finite matrix groups that use the output of the CompositionTree algorithm. We also describe how this output can be used to help find an effective base and strong generating set for such groups. We have implemented the resulting algorithms in Magma , and we report on their performance.

Details

ISSN :
07477171
Volume :
95
Database :
OpenAIRE
Journal :
Journal of Symbolic Computation
Accession number :
edsair.doi.dedup.....8fde3e9c6ccfb979a9e7f2b1c74b297b
Full Text :
https://doi.org/10.1016/j.jsc.2018.09.001