Parking Functions of Types A and B

Source 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.