Structure of conjugacy classes in Coxeter groups
Timoth\'ee Marquis

TL;DR
This paper provides a comprehensive description of conjugacy classes in Coxeter groups using cyclic shifts, introduces a structural conjugation graph, and proves its connectivity, advancing understanding of conjugacy structures in these groups.
Contribution
It explicitly computes the structural conjugation graph for any Coxeter group conjugacy class and proves its connectivity, also describing centralisers and decompositions of elements.
Findings
Structural conjugation graph is connected for all conjugacy classes.
Explicit computation of the conjugation graph for any Coxeter group.
Description of centralisers and element decompositions in Coxeter groups.
Abstract
This paper gives a definitive solution to the problem of describing conjugacy classes in arbitrary Coxeter groups in terms of cyclic shifts. Let be a Coxeter system. A cyclic shift of an element is a conjugate of of the form for some simple reflection such that . The cyclic shift class of is then the set of elements of that can be obtained from by a sequence of cyclic shifts. Given a subset such that is finite, we also call two elements -conjugate if normalise and , where is the longest element of . Let be a conjugacy class in , and let be the set of elements of minimal length in . Then is the disjoint union of finitely many cyclic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSupramolecular Self-Assembly in Materials · Cellular Automata and Applications · Algebraic structures and combinatorial models
