Matching theorems for systems of a finitely generated Coxeter group
arXiv:math/0501075 · doi:10.2140/agt.2007.7.919
Abstract
In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for finding a set of Coxeter generators of maximum rank for a finitely generated Coxeter group.
This paper replaces our earlier paper "On the isomorphism problem for finitely generated Coxeter groups. I, Basic matching". 49 pages. Sections 7-10 are new