Enumerations relating braid and commutation classes.

Susanna Fishel,Elizabeth Milicevic,Rebecca Patrias,Bridget Eileen Tenner

European Journal of Combinatorics（2018）

引用 4|浏览6

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要