Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability
群论
2016-09-07 v1 几何拓扑
摘要
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have 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.
引用
@article{arxiv.math/0203020,
title = {Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability},
author = {Paul E. Schupp},
journal= {arXiv preprint arXiv:math/0203020},
year = {2016}
}
备注
17 figures