Some enumerative properties of parking functions

arXiv2306.08681MaRDI QIDQ6440324FDOQ6440324

Authors: Richard P. Stanley, Mei Yin 

Publication date: 14 June 2023

Abstract: A parking function is a sequence $(a_1,dots,a_n)$ of positive integers such that if $b_{1}leqcdotsleq{b}_n$ is the increasing rearrangement of $a_1,dots,a_n$, then $b_{i}leqi$ for $1leqileqn$. In this paper we obtain some new results on the enumeration of parking functions. We will consider the joint distribution of several sets of statistics on parking functions. The distribution of most of these individual statistics is known, but the joint distributions are new. Parking functions of length $n$ are in bijection with labelled forests on the vertex set $[n]=1,2,dots,n$ (or rooted trees on $[n{]}_0=0,1,dots,n$ with root $0$), so our results can also be applied to labelled forests. Extensions of our techniques are discussed.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Combinatorial identities, bijective combinatorics (05A19)

This page was built for publication: Some enumerative properties of parking functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440324)