SearcharxivSearch

arXiv · 1403.1130

Characterization of Cyclically Fully commutative elements in finite and affine Coxeter Groups

Abstract

An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group W is cyclically fully commutative if any of its cyclic shifts remains fully commutative. These elements were studied in Boothby et al.. In particular the authors enumerated cyclically fully commutative elements in all Coxeter groups having a finite number of them. In this work we characterize and enumerate cyclically fully commutative elements according to their Coxeter length in all finite or affine Coxeter groups by using a new operation on heaps, the cylindric transformation. In finite types, this refines the work of Boothby et al., by adding a new parameter. In affine type, all the results are new. In particular, we prove that there is a finite number of cyclically fully commutative logarithmic elements in all affine Coxeter groups. We study afterwards the cyclically fully commutative involutions and prove that their number is finite in all Coxeter groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathias Pétréolle. 2014-03-05. Characterization of Cyclically Fully commutative elements in finite and affine Coxeter Groups. https://arxiv.org/abs/1403.1130

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR