Metraipolis › archive › dc_37243f9ba96d

Characterizing $k$-Naples parking functions and refining bounds via obstructed parking functions — arXiv:2611.02098

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02098
License (as archived)
CC0-1.0
Archived
2026-11-03T18:50:34.162Z
SHA-256 of the archived text
24f91ae6b56c3f354851b5ef422c80594d3c9075b9ed8061fe9c4bf86751853f
Stable URL of this page
https://metraipolis.com/documento/dc_37243f9ba96d

How to cite

Characterizing $k$-Naples parking functions and refining bounds via obstructed parking functions — arXiv:2611.02098 — arXiv (en), https://arxiv.org/abs/2611.02098 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_37243f9ba96d (Metraipolis archive dc_37243f9ba96d, sha256 24f91ae6b56c3f354851b5ef422c80594d3c9075b9ed8061fe9c4bf86751853f)
BibTeX
@misc{dc37243f9ba96d,
  title = {Characterizing $k$-Naples parking functions and refining bounds via obstructed parking functions — arXiv:2611.02098},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02098},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_37243f9ba96d; sha256 24f91ae6b56c3f354851b5ef422c80594d3c9075b9ed8061fe9c4bf86751853f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02098. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.02098 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:38.089Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).