In this paper, we provide an upper bound for the number of one-element commutation classes of a permutation, that is, the number of reduced words in which no commutation can be applied. Using this upper bound, we prove a conjecture that relates the number of reduced words with the number of commutation classes of a permutation.
No takes yet. Share an insight, caveat, or question.
Mamede et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: