Answers are grounded in this paper and cite their sources.
A parking function is a sequence (a₁,,aₙ) of positive integers such that, if b₁≤ b₂≤ ⋯≤ bₙ is the increasing rearrangement of the sequence (a₁,, aₙ), then bᵢ≤ i. A noncrossing partition of the set [n]=\1,2,,n\ is a partition π of the set $[n]$ with the property that if $a < b < c < d$ and some block B of π contains both a and c, while some block $B'$ of π contains both b and d, then $B=B'$. We establish some connections between parking functions and noncrossing partitions. A generating function for the flag f-vector of the lattice NCₙ₊₁ of noncrossing partitions of [ n+1] is shown to coincide (up to the involution ω on symmetric function) with Haiman's parking function symmetric function. We construct an edge labeling of NCₙ₊₁ whose chain labels are the set of all parking functions of length n. This leads to a local action of the symmetric group Sₙ on NCₙ₊₁.
No takes yet. Share an insight, caveat, or question.
Richard P. Stanley (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: