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
|
相似书籍
Controlled embeddings into groups that have no non-trivial finite
quotients
由: Bridson, M
出版: (1999)
由: Bridson, M
出版: (1999)
相似书籍
-
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)