On the enumeration of permutation-invariant and complete Naples parking functions
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915013468356608 |
|---|---|
| author | Ferrari, Luca Verciani, Francesco |
| author_facet | Ferrari, Luca Verciani, Francesco |
| contents | Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous slots, before proceedings forward as usual. In our previous work (arXiv:2405.07522, 2024) we have provided a characterization of Naples parking functions in terms of the new notion of \emph{complete parking preference}. Our result also allowed us to describe a new characterization of permutation-invariant Naples parking functions, equivalent (but much simpler) to the one given by Carvalho et al.(arXiv:2109.01735, 2021) but using a completely different approach (and language).
In the present article we address some natural enumerative issues concerning the above mentioned objects. We propose an effective approach to enumerate permutation-invariant Naples parking functions and complete Naples parking functions which is based on some natural combinatorial decompositions. We thus obtain formulas depending on some (generally simpler) quantities, which are of interest in their own right, and that can be described in a recursive fashion. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_06876 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the enumeration of permutation-invariant and complete Naples parking functions Ferrari, Luca Verciani, Francesco Combinatorics 05A05, 05A10, 05A15 Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous slots, before proceedings forward as usual. In our previous work (arXiv:2405.07522, 2024) we have provided a characterization of Naples parking functions in terms of the new notion of \emph{complete parking preference}. Our result also allowed us to describe a new characterization of permutation-invariant Naples parking functions, equivalent (but much simpler) to the one given by Carvalho et al.(arXiv:2109.01735, 2021) but using a completely different approach (and language). In the present article we address some natural enumerative issues concerning the above mentioned objects. We propose an effective approach to enumerate permutation-invariant Naples parking functions and complete Naples parking functions which is based on some natural combinatorial decompositions. We thus obtain formulas depending on some (generally simpler) quantities, which are of interest in their own right, and that can be described in a recursive fashion. |
| title | On the enumeration of permutation-invariant and complete Naples parking functions |
| topic | Combinatorics 05A05, 05A10, 05A15 |
| url | https://arxiv.org/abs/2411.06876 |