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)