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 chord. As an application, we construct counterexamples to two conjectures concerning the isomorphism problem for Coxeter groups.
KeywordsCoxeter groups Diagram twisting Isomorphism problem Chordal graphs
Mathematics Subject Classification (2000)20F55
Unable to display preview. Download preview PDF.
- 4.Coxeter H.S.M.: Regular Polytopes. Dover, New York (1973)Google Scholar
- 6.Franzsen, W.N.: Automorphisms of Coxeter groups. PhD thesis, University of Sydney (2001)Google Scholar
- 9.Grassi, M.: The Isomorphism problem for a class of finitely generated Coxeter groups. PhD thesis, University of Sydney (2007)Google Scholar
- 10.Howlett, R.B., Mühlherr, B.: Isomorphisms of Coxeter groups which do not preserve reflections. 18 p (2004, Preprint)Google Scholar
- 13.Mihalik, M., Tschantz, S.: Visual decompositions of Coxeter groups, arXiv: math.GR/0703439v1 14 Mar 2007.Google Scholar
- 14.Mühlherr, B.: The isomorphism problem for Coxeter groups. In: The Coxeter legacy: reflections and projections. Davis C., Ellers E.W. (eds.) Amer. Math. Soc. pp. 1–15 (2006)Google Scholar
- 15.Ratcliffe, J., Tschantz, S.: Chordal Coxeter groups. arXiv:math.GR/0607301v2 12 Jul 2006.Google Scholar