Generating series of cyclically fully commutative elements is rational

preprint2016arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.