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