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...
Автори: | Bridson, M, Evans, D, Liebeck, M, Segal, D |
---|---|
Формат: | Journal article |
Опубліковано: |
Springer Verlag
2019
|
Схожі ресурси
Схожі ресурси
-
Product decompositions in finite simple groups
за авторством: Liebeck, M, та інші
Опубліковано: (2011) -
Finite permutation groups
за авторством: Liebeck, M, та інші
Опубліковано: (1979) -
On the difficulty of presenting finitely presentable groups
за авторством: Bridson, M, та інші
Опубліковано: (2010) -
The finite images of finitely generated groups
за авторством: Segal, D
Опубліковано: (2001) -
The maximal factorizations of the finite simple groups and their antomorphism ground /
за авторством: Liebeck, M. W. (Martin W.), 1954-, та інші
Опубліковано: (1990)