Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability
Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability
复制标题
Coxeter 群、2-完成、周长缩减和子群可分离性
DOI：
10.1023/a:1022155823425
复制
发表时间：
2002
影响因子：
0.5
通讯作者：
P. Schupp
中科院分区：
文献类型：
--
作者：
P. Schupp
我们表明，在一个非常大的类Coxeter群的所有群体是局部拟凸的，并有一个统一的成员资格问题可解的二次时间。如果一个群满足进一步的假设，它是子群可分的，相关的同态也可以在二次时间内计算。该算法还决定了一个随机生成的子群是否具有有限指数。
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have a uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and relevant homomorphisms are also calculable in quadratic time. The algorithm also decides if a finitely generated subgroup has finite index.