Enumerations relating braid and commutation classes
classification
🧮 math.CO
keywords
classesnumberbraidcommutationpermutationachieveboundbounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.