Commutation classes of reduced words and higher Bruhat orders for affine permutations
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915961052856320 |
|---|---|
| author | Billey, Sara Chau, Herman Liu, Kevin |
| author_facet | Billey, Sara Chau, Herman Liu, Kevin |
| contents | The higher Bruhat orders are partial orders that generalize the weak order on the symmetric group $S_n$, and the second higher Bruhat order is a poset on commutation classes of reduced words for the longest element in $S_n$, where covering relations correspond to braid relations. Constructing analogs in other settings is an area of recent interest, and we present an analog that generalizes any interval $[id,w]$ in the weak order of both the symmetric group and the affine symmetric group. Paralleling the classical case, we show that the second higher Bruhat order is a poset on commutation classes of reduced words for any affine permutation. For the symmetric group, we also establish results for all higher Bruhat orders that are direct analogs of those in the classical case. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_24573 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Commutation classes of reduced words and higher Bruhat orders for affine permutations Billey, Sara Chau, Herman Liu, Kevin Combinatorics 05E16 (Primary) 06A07, 20F55, 05A05 (Secondary) The higher Bruhat orders are partial orders that generalize the weak order on the symmetric group $S_n$, and the second higher Bruhat order is a poset on commutation classes of reduced words for the longest element in $S_n$, where covering relations correspond to braid relations. Constructing analogs in other settings is an area of recent interest, and we present an analog that generalizes any interval $[id,w]$ in the weak order of both the symmetric group and the affine symmetric group. Paralleling the classical case, we show that the second higher Bruhat order is a poset on commutation classes of reduced words for any affine permutation. For the symmetric group, we also establish results for all higher Bruhat orders that are direct analogs of those in the classical case. |
| title | Commutation classes of reduced words and higher Bruhat orders for affine permutations |
| topic | Combinatorics 05E16 (Primary) 06A07, 20F55, 05A05 (Secondary) |
| url | https://arxiv.org/abs/2604.24573 |