Clusters, Coxeter-sortable elements and noncrossing partitions
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2005
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916005585879040 |
|---|---|
| author | Reading, Nathan |
| author_facet | Reading, Nathan |
| contents | We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_math_0507186 |
| institution | arXiv |
| publishDate | 2005 |
| record_format | arxiv |
| spellingShingle | Clusters, Coxeter-sortable elements and noncrossing partitions Reading, Nathan Combinatorics 20F55 (Primary) 05E15, 05A15 (Secondary) We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations. |
| title | Clusters, Coxeter-sortable elements and noncrossing partitions |
| topic | Combinatorics 20F55 (Primary) 05E15, 05A15 (Secondary) |
| url | https://arxiv.org/abs/math/0507186 |