On the cyclically fully commutative elements of Coxeter groups.
From MaRDI portal
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 source-to-sink 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 simply-laced Coxeter groups. Finally, we give a simple non-CFC element that fails to be logarithmic under these conditions.
Recommendations
- Characterization of cyclically fully commutative elements in finite and affine Coxeter groups
- Long fully commutative elements in affine Coxeter groups.
- Conjugacy classes and straight elements in Coxeter groups.
- Length enumeration of fully commutative elements in finite and affine Coxeter groups
- On the fully commutative elements of Coxeter groups
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1516227 (Why is no real title available?)
- scientific article; zbMATH DE number 3209202 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A finiteness property and an automatic structure for Coxeter groups
- Acyclic orientations of graphs
- Combinatorics of Coxeter Groups
- Conjugacy of Coxeter elements.
- Full heaps and representations of affine Kac-Moody algebras
- On enumeration of conjugacy classes of Coxeter elements
- On the fully commutative elements of Coxeter groups
- Pattern avoidance and the Bruhat order.
- Posets from admissible Coxeter sequences.
- Powers of Coxeter elements in infinite groups are reduced
- The conjugacy problem for Coxeter groups.
- The enumeration of fully commutative elements of Coxeter groups
Cited in
(13)- Torsion free commutator subgroups of generalized Coxeter groups.
- On inversion triples and braid moves
- Conjugacy classes and straight elements in Coxeter groups.
- A root system criterion for fully commutative and short braid-avoiding elements in affine Weyl groups
- Partially commutative Artin-Coxeter groups and their arboreal structure.
- Fully commutative elements and Kazhdan–Lusztig cells in the finite and affine Coxeter groups
- Characterization of cyclically fully commutative elements in finite and affine Coxeter groups
- Cyclically reduced elements in Coxeter groups
- Length enumeration of fully commutative elements in finite and affine Coxeter groups
- Morphisms and order ideals of toric posets
- A note on fully commutative elements in complex reflection groups
- On the fully commutative elements of type \({\tilde{C}}\) and faithfulness of related towers
- ON COMMUTATIVITY OF CIRCULARLY ORDERED C-O-STABLE GROUPS
This page was built for publication: On the cyclically fully commutative elements of Coxeter groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438738)
