Mathias Pétréolle
Published 2016-12-12Version 1
In this paper, we study the generating function of cyclically fully commutative elements in Coxeter groups, which are elements such that any cyclic shift of theirs reduced decompositions remains a reduced expression of a fully commutative element. By designing a finite state automaton recognizing reduced expressions of cyclically fully commutative elements, we can show that the aforementioned generating series is always rational.
Comments: 16 pages, 4 figures
The Absolute Orders on the Coxeter Groups $A_n$ and $B_n$ are Sperner
Classification of Coxeter groups with finitely many elements of $\mathbf{a}$-value 2
On the nature of the generating series of walks in the quarter plane
![QR code for arXiv:1612.03764 [math.CO]](http://oss.arxitics.com/images/favicon.svg)