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)