paper

Clusters, Coxeter-sortable elements and noncrossing partitions

arXiv:math/0507186 · doi:10.1090/S0002-9947-07-04319-X

Abstract

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.

Minor changes in exposition, including: More precise statement in Remark 6.8; Added Remark 6.9, an observation which is helpful in the sequel (math.CO/0512339); Updated textual references to the sequel and to a paper in preparation (with D. Speyer). 28 pages, 8 figures

References in corpus (7)

Cited by in corpus (64)