Algorithms determining finite simple images of finitely presented groups
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative results. For a collection of finite simple groups that contains inf...
Main Authors: | Bridson, M, Evans, D, Liebeck, M, Segal, D |
---|---|
Format: | Journal article |
Izdano: |
Springer Verlag
2019
|
Podobne knjige/članki
-
Product decompositions in finite simple groups
od: Liebeck, M, et al.
Izdano: (2011) -
Finite permutation groups
od: Liebeck, M, et al.
Izdano: (1979) -
On the difficulty of presenting finitely presentable groups
od: Bridson, M, et al.
Izdano: (2010) -
The finite images of finitely generated groups
od: Segal, D
Izdano: (2001) -
The maximal factorizations of the finite simple groups and their antomorphism ground /
od: Liebeck, M. W. (Martin W.), 1954-, et al.
Izdano: (1990)