Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.20267

A new generalization of parking functions: $ρ$-Naples parking functions

Luca Ferrari·Francesco Verciani
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a new model of parking functions, called $ρ$-Naples parking functions, in which each car has a certain number of spots to check preceding its preferred one before looking for available spots by moving forward. This notion, where each car has its own number of previous spots to check, generalizes that of Naples parking function, where this number is the same for all cars. We start by showing that, for a given sequence of preferences for each car, a successful parking strategy (that is, an assignment of how many backward spots each car is allowed to check) remains successful if we increase the number of backwards spots to check for some of the cars. This means that the set of successful strategies for a given parking preference is an up-set in the lattice of parking strategies, which raises the intriguing question of characterizing such up-sets. Though we are not able to completely solve this problem, we provide a characterization of those successful strategies which minimize the total number of allowed backward steps for a given parking preference, and we determine a lower bound for the number of cars which are allowed to move backwards (also showing that it can be attained). To conclude, we analyze the specific situation in which each car can take at most one backward step, and we completely characterize the set of successful parking preferences in this case.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Ferrari, Francesco Verciani. 2026-10-14. A new generalization of parking functions: $ρ$-Naples parking functions. https://arxiv.org/abs/2610.20267

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On composition and decomposition operations for vector spaces, graphs and matroids

In this paper, we study the ideas of composition and decomposition in the context of vector spaces, graphs and matroids. For vector spaces $\V_{AB},$ treated as collection of row vectors, with specified column set $A\uplus B,$ we define $\V_{SP}\lrarv \V_{PQ}, S\cap Q= \emptyset, $ to be the collection of all vectors $(f_S,f_Q)$ such that $(f_S,f_P)\in \V_{SP}, (f_P,f_Q)\in \V_{PQ}$. An analogous operation $\G_{SP}\lrarg \G_{PQ}\equivd \G_{PQ}$ can be defined in relation to graphs $\G_{SP}, \G_{PQ},$ on edge sets $S\uplus P, P\uplus Q,$ respectively in terms of an overlapping subgraph $\G_P$ which gets deleted in the right side graph (see for instance the notion of $k-sum$ \cite{oxley}). For matroids we define the `linking' $\M_{SP}\lrarm \M_{PQ} \equivd (\M_{SP}\vee \M_{PQ})\times (S\uplus Q)$, denoting the contraction operation by '$\times$'. In each case, we examine how to minimize the size of the `overlap' set $P,$ without affecting the right side entity. In the case of vector spaces, there is a polynomial time algorithm for achieving the minimum, which we present. Similar ideas work for graphs and for matroids under appropriate conditions. Next we consider the problem of decomposition. Here, in the case of vector spaces, the problem is to decompose $\V_{SQ}$ as $\V_{SP}\lrarv \V_{PQ},$ with minimum size $P.$ We give a polynomial time algorithm for this purpose. In the case of graphs and matroids we give a solution to this problem under certain restrictions.

math.CO↗
arXiv2026

Exploring the unleaved tree of numerical semigroups up to a given genus

We present a new algorithm for exploring or counting the numerical semigroups of a given genus that uses the unleaved version of the tree of numerical semigroups. In the unleaved tree there are no leaves rather than the ones at depth equal to the genus in consideration. For exploring the unleaved tree we present a new encoding system of a numerical semigroup given by the gcd of its left elements and its shrinking, that is, the semigroup generated by its left elements divided by their gcd. We show a method to determine the right generators and strong generators of a semigroup by means of the gcd and the shrinking encoding, as well as a method to encode a semigroup from the encoding of its parent or of its preceding sibling. With the new algorithm, we obtained $n_{76}=29028294421710227$ and $n_{77}=47008818196495180$.

math.CO↗
arXiv2026

On a question about real rooted polynomials and f-polynomials of simplicial complexes

For a polynomial $f(t) = 1+f_0t+\cdots +f_{d-1}t^d$ with positive integer coefficients Bell and Skandera ask if real rootedness of f(t) implies that there is a simplicial complex with f-vector $(1,f_0 \ldots,f_{d-1})$. In this paper we discover properties implied by the real rootedness of f(t) in terms of the binomial representation $f_i = \binom{x_{i+1}}{i+1}, i \geq 0$. We use these to provide a sufficient criterion for a positive answer to the question by Bell and Skandera. We also describe two further approaches to the conjecture and use one to verify that some well studied real rooted classical polynomials are f-polynomials. Finally, we provide a series of results showing that the set of f-vectors of simplicial complexes is closed under constructions also preserving real rootedness of their generating polynomials.

math.CO↗