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...
Hlavní autoři: | Bridson, M, Evans, D, Liebeck, M, Segal, D |
---|---|
Médium: | Journal article |
Vydáno: |
Springer Verlag
2019
|
Podobné jednotky
-
Product decompositions in finite simple groups
Autor: Liebeck, M, a další
Vydáno: (2011) -
Finite permutation groups
Autor: Liebeck, M, a další
Vydáno: (1979) -
On the difficulty of presenting finitely presentable groups
Autor: Bridson, M, a další
Vydáno: (2010) -
The finite images of finitely generated groups
Autor: Segal, D
Vydáno: (2001) -
The maximal factorizations of the finite simple groups and their antomorphism ground /
Autor: Liebeck, M. W. (Martin W.), 1954-, a další
Vydáno: (1990)