Enumerating Parking Completions Using Join and Split

Ayomikun Adeniran, Steve Butler, Galen Dorpalen-Barry +5

Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\dots ,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|…