Matching theorems for systems of a finitely generated Coxeter group
Michael Mihalik, John Ratcliffe, Steven Tschantz
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.
Create a lesson
Related papers
Invariant random subgroups of the finitary special linear group over a finite field
Noam Atar, Arie Levit
Vanishing-set inclusion and character degrees in finite p-groups
Zhi-Lin Zhang
Singular Loci of SL2(C)-Representation Varieties of Non-Hopfian Baumslag--Solitar Groups
S. Liriano
Finite groups with all involutions fused
Zheng Guo, Yan Zhou Zhu
A complete description of the algebraic structure of pseudocompact abelian groups
Dikran Dikranjan, Alejandro Dorantes-Aldama, Dmitri Shakhmatov
Constructing free subgroups of matrix groups
Emmanuel Breuillard, Bettina Eick, Tommy Hofmann et al.