A Decomposition Theorem for Higher Rank Coxeter Groups
Ryan Blair, Ryan Ottman
Abstract
Ryan Blair, Ryan Ottman
Abstract
In this paper, we show that any Coxeter graph which defines a higher rank Coxeter group must have disjoint induced subgraphs each of which defines a hyperbolic or higher rank Coxeter group where the groups in question do not necessarily act cocompactly or cofinitely. We then use this result to demonstrate several classes of Coxeter graphs which define hyperbolic Coxeter groups and to produce structure theorems for hyperbolic Coxeter groups.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we show that any Coxeter graph which defines a higher rank Coxeter group must have disjoint induced subgraphs each of which defines a hyperbolic or higher rank Coxeter group where the groups in question do not necessarily act cocompactly or cofinitely. We then use this result to demonstrate several classes of Coxeter graphs which define hyperbolic Coxeter groups and to produce structure theorems for hyperbolic Coxeter groups.
Key concepts: Coxeter group, Longest element of a Coxeter group, Mathematics, Point group, Coxeter complex, Artin group, Coxeter element, Combinatorics