Papers
Topics
Authors
Recent
2000 character limit reached

Long fully commutative elements in affine Coxeter groups

Published 21 Jul 2014 in math.CO and math.GR | (1407.5575v1)

Abstract: An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and affine Coxeter groups" (arXiv:1402.2166), R. Biagioli and the authors proved among other things that, for each irreducible affine Coxeter group, the sequence counting fully commutative elements with respect to length is ultimately periodic. In the present work, we study this sequence in its periodic part for each of these groups, and in particular we determine the minimal period. We also observe that in type $A$ affine we get an instance of the cyclic sieving phenomenon.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.