Chordal Coxeter Groups
John Ratcliffe, Steven Tschantz
Abstract
A solution of the isomorphism problem is presented for the class of Coxeter groups W that have a finite set of Coxeter generators S such that the underlying graph of the presentation diagram of the system (W,S) has the property that every cycle of length at least four has a cord. As an application, we construct counterexamples to two main conjectures concerning the isomorphism problem for Coxeter groups.
Create a lesson
Related papers
Kleisli convolution representations of power monoids
Haicun Wen, Jian He, Yu-Zhe Liu
The Hurwitz Action in the Affine Symmetric Group
Patrick Wegener
Classification of Group Extensions
Claude Archer
A Determination of B-groups of Order p4
Christopher Herbig
A note on normal generation and the first 2-betti number
Sam P. Fisher, Yash Lodha
Asymptotic enumeration of minimally transitive permutation groups
Binzhou Xia, Shasha Zheng