2000 character limit reached
Generating series of cyclically fully commutative elements is rational (1612.03764v1)
Published 12 Dec 2016 in math.CO
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.