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 commuta......
小提示:本篇文献需要登录阅读全文,点击跳转登录