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...
Main Authors: | Bridson, M, Evans, D, Liebeck, M, Segal, D |
---|---|
פורמט: | Journal article |
יצא לאור: |
Springer Verlag
2019
|
פריטים דומים
פריטים דומים
-
Product decompositions in finite simple groups
מאת: Liebeck, M, et al.
יצא לאור: (2011) -
Finite permutation groups
מאת: Liebeck, M, et al.
יצא לאור: (1979) -
On the difficulty of presenting finitely presentable groups
מאת: Bridson, M, et al.
יצא לאור: (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-, et al.
יצא לאור: (1990)