Abstract
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parking functions. We use an analogous embedding for type B non-crossing partitions in order to answer a question raised by R. Stanley on the edge labeling of the type B non-crossing partitions lattice.
Topics

No keywords indexed for this article. Browse by subject →

Metrics
11
Citations
0
References
Details
Published
Sep 30, 2001
Vol/Issue
9(1)
Authors
Cite This Article
P. Biane (2001). Parking Functions of Types A and B. The Electronic Journal of Combinatorics, 9(1). https://doi.org/10.37236/1668
Related

You May Also Like

The Sandwich Theorem

Donald E. Knuth · 1994

165 citations

Pólya's Permanent Problem

William McCuaig · 2004

81 citations

Distance-Regular Graphs

Edwin R. Van Dam, Jack H. Koolen · 2016

77 citations

A Dynamic Survey of Graph Labeling

Joseph A. Gallian · 2022

74 citations