Maximal number of one-element commutation classes of a permutation

A reduced word for a permutation of the symmetric group is its own commutation class if it has no commutation moves available. In this talk we provide an upper bound for the number of one-element commutation classes of a permutation. Using this upper bound, we prove a conjecture that relates the number of reduced words with the number of commutation classes of a permutation.

----------------------------------------------------

There will be coffee and cake after the seminar in the common room