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 |
---|---|
Formato: | Journal article |
Publicado em: |
Springer Verlag
2019
|
Registos relacionados
-
Product decompositions in finite simple groups
Por: Liebeck, M, et al.
Publicado em: (2011) -
Finite permutation groups
Por: Liebeck, M, et al.
Publicado em: (1979) -
On the difficulty of presenting finitely presentable groups
Por: Bridson, M, et al.
Publicado em: (2010) -
The finite images of finitely generated groups
Por: Segal, D
Publicado em: (2001) -
The maximal factorizations of the finite simple groups and their antomorphism ground /
Por: Liebeck, M. W. (Martin W.), 1954-, et al.
Publicado em: (1990)