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)