Enumerations relating braid and commutation classes
Combinatorics
2018-08-06 v2
Abstract
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.
Cite
@article{arxiv.1708.04372,
title = {Enumerations relating braid and commutation classes},
author = {Susanna Fishel and Elizabeth Milićević and Rebecca Patrias and Bridget Eileen Tenner},
journal= {arXiv preprint arXiv:1708.04372},
year = {2018}
}
Comments
19 pages