Parking completions are $\mathbf{x}$-parking functions

Parking functions correspond with preferences of $n$ cars which enter sequentially to park on a one-way street where (1) each car parks in the first available spot greater than or equal to its preference and (2) all cars successfully park.

We generalize parking functions to parking completions: Here, we are given that some cars have already parked in a set of spots, which are indexed in a sequence $\mathbf{t}$.

We then consider a preference list $\mathbf{c}$, where length of $\mathbf{t}$ + length of $\mathbf{c}$ = $n$.

If all cars can park, we say that $\mathbf{c}$ is a parking completion.

Adeniran et al.

(2020) state an open problem which proposes a connection between the number of parking completions to the volumes of Pitman-Stanley polytopes by explicit computation on small values of $n$.

In this paper, we provide a solution to this open problem by proving a theorem which explains that the set of parking completions is the set of $\mathbf{x}$-parking functions.