Maximum number of one-element commutation classes of a permutation

Discrete Mathematics 2026 Open access

Read full text
Authors: Ricardo Mamede, José Luís Santos, Diogo Soares
DOI: 10.1016/j.disc.2026.115471
Cited by: 0

Abstract

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.

Fields of Study & Subjects

Advanced Combinatorial Mathematics semigroups and automata theory Finite Group Theory Research

Publication details

Journal / source
Discrete Mathematics
Volume
350
Issue
3
Pages
115471–115471
Publication date
21 October 2026
Language
EN