TY - JOUR
T1 - Enumerations relating braid and commutation classes
AU - Fishel, Susanna
AU - Milićević, Elizabeth
AU - Patrias, Rebecca
AU - Tenner, Bridget Eileen
N1 - Funding Information:
SF was partially supported by grant 359602 from the Simons Foundation , as well as by funds from the Mathematical Sciences Research Institute. EM was partially supported by National Science Foundation grant DMS-1600982 . RP was supported by NSERC ( 312569 ), the Canada Research Chairs Program ( 230635 ), and CRM-ISM . BT was partially supported by Simons Foundation Collaboration Grant for Mathematicians 277603 and a DePaul University Faculty Summer Research Grant .
Publisher Copyright:
© 2018 Elsevier Ltd
PY - 2018/12
Y1 - 2018/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85050884680&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050884680&partnerID=8YFLogxK
U2 - 10.1016/j.ejc.2018.07.002
DO - 10.1016/j.ejc.2018.07.002
M3 - Article
AN - SCOPUS:85050884680
SN - 0195-6698
VL - 74
SP - 11
EP - 26
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
ER -