Prime Parking Functions in Combinatorics

• Prime parking functions are indecomposable parking configurations defined by strict inequalities in preference sequences, serving as the basic building blocks in combinatorial decompositions.
• Their classical enumeration, such as (n-1)^(n-1), is established via bijections, path models, and generating functions that connect linear and tree-based paradigms.
• Generalizations to vector, (p,q), two-dimensional, and graphical settings extend their significance, revealing deep ties to algebraic combinatorics and symmetric-function theory.

Searching arXiv for papers on prime parking functions and related generalizations. Prime parking functions are the indecomposable objects in the combinatorics of parking functions. In the classical one-way street model of Konheim and Weiss, a parking function of length $n$ is a sequence whose nondecreasing rearrangement $q_1\le \cdots \le q_n$ satisfies $q_i\le i$ for all $i$; it is prime when the stronger inequalities $q_i<i$ hold for all $i=2,\dots,n$, or equivalently when deleting a single entry equal to $1$ produces a parking function of length $n-1$ (Duarte et al., 2023). The same idea reappears in rooted trees, where primeness means that every edge is traversed by some displaced driver, and in broader settings such as vector, $(p,q)$, two-dimensional, and graphical parking functions, where primeness is defined by forbidding nontrivial decompositions (King et al., 2018, Armon et al., 2024, Selig et al., 29 Jun 2025).

1. Classical definition and indecomposability

A classical parking function of length $n$ is a sequence $q_1\le \cdots \le q_n$0 such that every car parks under the forward-only parking rule. Equivalently, if $q_1\le \cdots \le q_n$1 is the nondecreasing rearrangement of $q_1\le \cdots \le q_n$2, then

$q_1\le \cdots \le q_n$3

This criterion is standard in the subject and underlies most later generalizations (Duarte et al., 2023).

A prime parking function is obtained by strengthening these inequalities. In one convention, a parking function $q_1\le \cdots \le q_n$4 is prime if

$q_1\le \cdots \le q_n$5

In the equivalent $q_1\le \cdots \le q_n$6-based convention used in generalized settings, a sequence $q_1\le \cdots \le q_n$7 is prime if

$q_1\le \cdots \le q_n$8

The two formulations differ only by indexing. In both, primeness is characterized by strictness on every proper initial segment (Duarte et al., 2023, Armon et al., 2024).

Several equivalent descriptions are central. A classical parking function is prime if and only if removing one occurrence of $q_1\le \cdots \le q_n$9 yields a parking function of length $q_i\le i$0; in the $q_i\le i$1-based convention, the corresponding statement uses removal of a $q_i\le i$2 (Duarte et al., 2023, Armon et al., 2024). Prime parking functions are also precisely those with no breakpoint except the final one: a breakpoint is an index $q_i\le i$3 such that exactly $q_i\le i$4 cars prefer spots in $q_i\le i$5, and its presence gives a decomposition into smaller parking functions. The absence of breakpoints therefore makes prime parking functions the indecomposable components of the classical theory (Selig et al., 29 Jun 2025).

Path models encode the same phenomenon. A parking function may be represented by a Catalan path, and any Catalan path factors uniquely as a concatenation of prime Catalan paths, namely those touching the diagonal only at start and end. Labeling the vertical steps yields a unique shuffle decomposition

$q_i\le i$6

with each $q_i\le i$7 prime and $q_i\le i$8 (Armon et al., 2024). This makes primeness a direct combinatorial analogue of irreducibility under path concatenation.

2. Enumeration in the classical case

The basic enumerative formulas are classical:

$q_i\le i$9

The second identity is the standard count of prime parking functions of length $i$0 (Duarte et al., 2023). In the shifted notation of some later papers, the same statement is written as

$i$1

which is equivalent after replacing $i$2 by $i$3 (Harris et al., 28 Jan 2026).

A direct combinatorial proof of

$i$4

was given by Duarte and Guedes de Oliveira through a bijection

$i$5

Starting from an arbitrary $i$6, they define cyclic sums

$i$7

choose

$i$8

and then construct a shifted sequence

$i$9

The resulting $q_i<i$0 is prime, and the decomposition $q_i<i$1 is unique, giving the enumeration immediately (Duarte et al., 2023).

The same proof yields a parking-lot interpretation. If parking spots are labeled cyclically as

$q_i<i$2

then for every preference list $q_i<i$3 with each $q_i<i$4 there is a unique entry point $q_i<i$5 such that all cars succeed; the corresponding shifted list is a prime parking function (Duarte et al., 2023). This reformulation places primeness close to the original parking rule rather than to an auxiliary recurrence or generating function.

3. Rooted-tree prime parking functions

King and Yan extended the notion of parking function from a line of parking spots to a rooted, vertex-labeled tree with all edges oriented toward the root. Drivers begin at preferred vertices and follow the unique directed path to the root until reaching the first vacant vertex. A preference sequence $q_i<i$6 is a parking function on a rooted tree $q_i<i$7 if all drivers park (King et al., 2018).

The rooted-tree model has an exact subtree criterion. For each vertex $q_i<i$8, let

$q_i<i$9

Then

$i=2,\dots,n$0

The prime condition is obtained by making all proper down-set inequalities strict:

$i=2,\dots,n$1

Equivalently, every non-root edge is used by some driver who fails to park at her preferred spot (King et al., 2018).

The main enumerative theorem is strikingly simple:

$i=2,\dots,n$2

where $i=2,\dots,n$3 denotes the number of prime parking functions on rooted trees with $i=2,\dots,n$4 vertices (King et al., 2018). The proof is given both by generating functions and by bijection. On the generating-function side, if

$i=2,\dots,n$5

then decomposition into a prime core and adjunct components yields

$i=2,\dots,n$6

and this combines with the explicit formula for $i=2,\dots,n$7 to imply

$i=2,\dots,n$8

where $i=2,\dots,n$9 is the Catalan generating function. Coefficient extraction gives $1$0 (King et al., 2018).

The same paper introduces increasing prime tree parking functions, called prime parking distributions, obtained by imposing

$1$1

Their total number is

$1$2

where $1$3 is the $1$4th large Schröder number and

$1$5

The generating function satisfies the quadratic differential equation

$1$6

whose solution yields the Schröder-number formula (King et al., 2018).

4. Decomposition principles and bijective models

Prime parking functions are important partly because general parking functions decompose into them. In the rooted-tree setting, every parking function splits uniquely into a prime core together with ordinary parking functions hanging from unused edges. In one formulation, every parking function has a unique root-core: the maximal connected subtree containing the root whose every edge is used. Removing that core leaves attached subtrees, each carrying an ordinary tree parking function; conversely, gluing a prime core to arbitrary attached parking functions reconstructs the original object (King et al., 2018, Panholzer, 2020).

This decomposition is structural rather than merely enumerative. In the notation of combinatorial classes, the total class $1$7 of parking functions and the prime class $1$8 satisfy a substitution equation of the form

$1$9

which becomes, at the level of generating functions,

$n-1$0

For Cayley trees, where $n-1$1, Panholzer derives an implicit solution leading again to

$n-1$2

and extends the method to ordered, binary, $n-1$3-ary, and bundled tree families (Panholzer, 2020).

Bijective approaches complement the generating-function theory. For rooted trees, there is a direct bijection

$n-1$4

which immediately yields

$n-1$5

The construction standardizes the parking procedure by recording the order in which edges are first crossed and then recursively peels off the final driver (King et al., 2018).

For classical parking functions, path bijections play an analogous role. A parking function $n-1$6 corresponds to a Łukasiewicz word

$n-1$7

and hence to a Łukasiewicz path that never dips below the axis. Prime parking functions correspond exactly to those paths that touch the axis only at the endpoints. There is also a bijection between labeled Łukasiewicz paths and labeled Dyck paths, and the area under the Łukasiewicz path equals the total displacement of the corresponding parking function (Harris et al., 28 Jan 2026). This suggests that primeness is naturally encoded by a “no intermediate return” condition across multiple combinatorial realizations.

5. Statistics, displacement, and quasisymmetric structure

Recent work studies prime parking functions beyond counting. Harris, Kara, McNicholas, Nyman, and Yin define the total displacement of a prime parking function $n-1$8 of length $n-1$9 by

$(p,q)$0

where $(p,q)$1 is the actual parking spot attained by car $(p,q)$2 (Harris et al., 28 Jan 2026).

They derive an exact formula for the displacement-enumerator

$(p,q)$3

namely

$(p,q)$4

where $(p,q)$5, $(p,q)$6, and $(p,q)$7 for each step (Harris et al., 28 Jan 2026). They also compute

$(p,q)$8

with a stated asymptotic expansion for $(p,q)$9 and a corresponding asymptotic formula for $n$0 (Harris et al., 28 Jan 2026).

Another refinement concerns local statistics modulo cyclic shift. For a tuple $n$1 and $n$2, an $n$3-forward difference at position $n$4 is defined by

$n$5

The case $n$6 records ties. The generating polynomial for the number of $n$7-forward differences is

$n$8

By differentiation at $n$9, the expected number of $q_1\le \cdots \le q_n$00-forward differences is $q_1\le \cdots \le q_n$01 for every fixed $q_1\le \cdots \le q_n$02; in particular, the expected number of ties in a uniform prime parking function is $q_1\le \cdots \le q_n$03, and the expected numbers of strict ascents and descents are each $q_1\le \cdots \le q_n$04 (Harris et al., 28 Jan 2026).

Prime parking functions also support quasisymmetric and Schur-positive expansions. Writing $q_1\le \cdots \le q_n$05 for Gessel’s fundamental quasisymmetric function and $q_1\le \cdots \le q_n$06 for the tie set of $q_1\le \cdots \le q_n$07, one has

$q_1\le \cdots \le q_n$08

where $q_1\le \cdots \le q_n$09 is the Schur function of hook shape $q_1\le \cdots \le q_n$10 (Harris et al., 28 Jan 2026). This places prime parking functions within the algebraic combinatorics of $q_1\le \cdots \le q_n$11-partitions and symmetric-function expansions.

6. Generalized and graphical prime parking functions

The indecomposability paradigm extends well beyond the classical line and rooted-tree models. Armon, Le Borgne, and Vazirani define primeness for vector parking functions, $q_1\le \cdots \le q_n$12-parking functions, and two-dimensional vector parking functions by replacing weak inequalities with strict ones on proper initial data, or equivalently by requiring the underlying path model to touch its boundary only at the start and end (Armon et al., 2024).

For a weakly increasing vector $q_1\le \cdots \le q_n$13, a $q_1\le \cdots \le q_n$14-parking function $q_1\le \cdots \le q_n$15 is prime when

$q_1\le \cdots \le q_n$16

Equivalently, $q_1\le \cdots \le q_n$17 is prime for $q_1\le \cdots \le q_n$18 if and only if it is an ordinary $q_1\le \cdots \le q_n$19-parking function for

$q_1\le \cdots \le q_n$20

When $q_1\le \cdots \le q_n$21 is an arithmetic progression, the paper gives explicit formulas:

$q_1\le \cdots \le q_n$22

and

$q_1\le \cdots \le q_n$23

The special case $q_1\le \cdots \le q_n$24 recovers the classical count $q_1\le \cdots \le q_n$25 (Armon et al., 2024).

For prime $q_1\le \cdots \le q_n$26-parking functions, the defining condition is that the two order-statistic lattice paths intersect only at $q_1\le \cdots \le q_n$27 and $q_1\le \cdots \le q_n$28. Equivalently, removing a zero from each of the two sequences produces an ordinary $q_1\le \cdots \le q_n$29-parking function. Their total number is

$q_1\le \cdots \le q_n$30

while the increasing ones satisfy

$q_1\le \cdots \le q_n$31

The degeneration $q_1\le \cdots \le q_n$32 or $q_1\le \cdots \le q_n$33 yields the classical prime enumeration (Armon et al., 2024).

Graphical generalizations replace the line or lattice path by an arbitrary connected graph with a sink. A $q_1\le \cdots \le q_n$34-parking function is prime if it admits no nontrivial decomposition across a partition $q_1\le \cdots \le q_n$35 of the nonsink vertices; in one-dimensional and bipartite specializations this recovers the classical and $q_1\le \cdots \le q_n$36 notions (Selig et al., 29 Jun 2025). Under the Postnikov–Shapiro correspondence

$q_1\le \cdots \le q_n$37

$q_1\le \cdots \le q_n$38-parking functions are in bijection with recurrent configurations of the Abelian sandpile model, and prime $q_1\le \cdots \le q_n$39-parking functions correspond to strongly recurrent configurations (Selig et al., 29 Jun 2025). This duality yields explicit counts on several graph families, including wheel graphs, complete graphs, complete multi-partite graphs, complete bipartite graphs with dominating sink, and complete split graphs (Selig et al., 29 Jun 2025).

A notable difference from the classical case appears here: every $q_1\le \cdots \le q_n$40 admits a prime decomposition into blocks, but unlike the classical line-graph case this decomposition need not be unique in general (Selig et al., 29 Jun 2025). This suggests that “prime” retains its role as an indecomposable unit, while uniqueness of factorization is sensitive to the ambient combinatorial geometry of the parking model.