Characterizing k-Naples parking functions and refining bounds via obstructed parking functions

@misc{tian2026characterizing,
  title = {{Characterizing $k$-Naples parking functions and refining bounds via obstructed parking functions}},
  author = {Roger Tian},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.02098},
  eprint = {2611.02098},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.02098},
}

TY  - UNPB
TI  - Characterizing k-Naples parking functions and refining bounds via obstructed parking functions
AU  - Roger Tian
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.02098
UR  - https://arxiv.org/abs/2611.02098
AB  - The Naples parking functions are a major generalization of the classical parking functions, where cars have more options to park because they are allowed to check (and possibly park) backward up to a fixed number of spots before driving forward as in the classical case. In a previous work, using involutions we established an injection from the Naples parking functions to a special set of obstructed parking functions, which we referred to as \textit{left obstructed}, thereby immediately obtaining a crude upper bound on the former set. We continue that work here by identifying the image of this injection, providing a characterization of Naples parking functions as a certain (smaller) set of obstructed parking functions, which we will refer to as \textit{long left obstructed}. We also derive a formula for the number of left obstructed parking functions. These combined allow us to improve the upper bound on the Naples parking functions. In addition, we demonstrate how lower bounds for this set can be obtained. As will become clear, the long left obstructed parking functions have certain combinatorial features that are useful in estimating the cardinality of the set, which are not obvious from solely looking at Naples parking functions.
ER  -