arXiv Analytics

Sign in

arXiv:1708.04372 [math.CO]AbstractReferencesReviewsResources

Enumerations relating braid and commutation classes

Susanna Fishel, Elizabeth Milićević, Rebecca Patrias, Bridget Eileen Tenner

Published 2017-08-15Version 1

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.

Related articles: Most relevant | Search more
arXiv:1503.05205 [math.CO] (Published 2015-03-17)
Reduced word manipulation: patterns and enumeration
arXiv:0809.2282 [math.CO] (Published 2008-09-12, updated 2015-05-31)
New lower bounds for the number of blocks in balanced incomplete block designs
arXiv:1309.3625 [math.CO] (Published 2013-09-14, updated 2014-03-14)
A Lower Bound on the Crossing Number of Uniform Hypergraphs