| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903539 | European Journal of Combinatorics | 2018 | 16 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Susanna Fishel, Elizabeth MiliÄeviÄ, Rebecca Patrias, Bridget Eileen Tenner,