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)