Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability

Abstract

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.

17 figures

Cited by in corpus (4)

• Stallings graphs for quasi-convex subgroups
• Kleinian groups and the rank problem
• Genericity, the Arzhantseva-Ol'shanskii method and the Isomorphism Problem for One-Relator Groups
• Exponent equations in HNN-extensions