Matching theorems for systems of a finitely generated Coxeter group
classification
🧮 math.GR
keywords
coxeterfinitelygeneratedgeneratorsgroupmatchingsetstheorems
read the original 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 has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.