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

2002/03/02 by Schupp, Paul E. · 1 citation
#20F #FOS: Mathematics #Geometric Topology (math.GT) #Group Theory (math.GR)

paper · doi:10.48550/arxiv.math/0203020

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.

Cited by

• Computing H-equations with 2-by-2 integral matrices

Related

• Two Algorithms in Group Theory
• Detecting quasiconvexity: algorithmic aspects
• Subgroups of right-angled Coxeter groups via Stallings-like techniques
• Profinite properties of Coxeter groups
• Non-commutative lattice problems