Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Some enumerative properties of parking functions (2306.08681v1)

Published 14 Jun 2023 in math.CO and math.PR

Abstract: A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. 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.

Summary

We haven't generated a summary for this paper yet.