On the Cyclically Fully Commutative Elements of Coxeter Groups
Abstract
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic shift of any reduced expression for w is fully commutative (i.e., avoids long braid relations). These generalize Coxeter elements in that their reduced expressions can be described combinatorially by acyclic directed graphs, and cyclically shifting corresponds to sourcetosink conversions. In this paper, we explore the combinatorics of the CFC elements and enumerate them in all Coxeter groups. Additionally, we characterize precisely which CFC elements have the property that powers of them remain fully commutative, via the presence of a simple combinatorial feature called a "band." This allows us to give necessary and sufficient conditions for a CFC element w to be "logarithmic," that is, l(w^k) = k l(w) for all k > 0, for a large class of Coxeter groups that includes all affine Weyl groups and simplylaced Coxeter groups. Finally, we give a simple nonCFC element that fails to be logarithmic under these conditions.
 Publication:

arXiv eprints
 Pub Date:
 February 2012
 DOI:
 10.48550/arXiv.1202.6657
 arXiv:
 arXiv:1202.6657
 Bibcode:
 2012arXiv1202.6657B
 Keywords:

 Mathematics  Combinatorics;
 Mathematics  Group Theory;
 20F55;
 05A15;
 20B10
 EPrint:
 24 pages, 4 figures