Strong accessibility of Coxeter groups over minimal splittings. (Q436092): Difference between revisions

Given a class of groups \(\mathcal C\). A group \(G\) is called strongly accessible over \(\mathcal C\) if there is a bound on the number of terms in a sequence \(\Lambda_1,\Lambda_2,\dots,\Lambda_n\) of graph of groups decompositions of \(G\) with edge groups in \(\mathcal C\) such that \(\Lambda_1\) is the trivial decomposition and for \(i>1\), \(\Lambda_i\) is obtained from \(\Lambda_{i-1}\) by non-trivially and compatibly splitting a vertex of the group of \(\Lambda_{i-1}\) over a group in \(\mathcal C\), replacing this vertex group by the splitting and then reducing. The main result that the authors prove is that finitely generated Coxeter groups are strongly accessible over minimal splittings. The authors also obtain a number of results under the assumption that \((W,S)\) is a Coxeter system and \(\Lambda\) is a graph of groups decomposition of \(W\).