Enumerations relating braid and commutation classes

Susanna Fishel, Elizabeth Milićević, Rebecca Patrias, Bridget Eileen Tenner

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)11-26
Number of pages16
JournalEuropean Journal of Combinatorics
Volume74
DOIs
StatePublished - Dec 1 2018

    Fingerprint

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this