Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.09395 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914255463251968 |
|---|---|
| author | Mamede, Ricardo Santos, José Luis Soares, Diogo |
| author_facet | Mamede, Ricardo Santos, José Luis Soares, Diogo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_09395 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Maximum number of one-element commutation classes of a permutation Mamede, Ricardo Santos, José Luis Soares, Diogo Combinatorics 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. |
| title | Maximum number of one-element commutation classes of a permutation |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2601.09395 |