Related papers: Counting Defective Parking Functions
In parking problems, a given number of cars enter a one-way street sequentially, and try to park according to a specified preferred spot in the street. Various models are possible depending on the chosen rule for collisions, when two cars…
In the Page parking (or packing) model on a discrete interval (also known as the discrete R{\'e}nyi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places,…
A classical parking function of length $n$ is a list of positive integers $(a_1, a_2, \ldots, a_n)$ whose nondecreasing rearrangement $b_1 \leq b_2 \leq \cdots \leq b_n$ satisfies $b_i \leq i$. The convex hull of all parking functions of…
In 2000, it was demonstrated that the set of $x$-parking functions of length $n$, where $x$=($a,b,...,b$) $\in \mathbbm{N}^n$, is equivalent to the set of rooted multicolored forests on [$n$]=\{1,...,$n$\}. In 2020, Yue Cai and Catherine H.…
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…
We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…
We enumerate a class of fully parked trees. In a probabilistic context, this means computing the partition function $F(x,y)$ of the parking process where an i.i.d. number of cars arrives at each vertex of a Galton-Watson tree with a…
We recall that unit interval parking functions of length $n$ are a subset of parking functions in which every car parks in its preference or in the spot after its preference, and Fubini rankings of length $n$ are rankings of $n$ competitors…
Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…
In 1966, Konheim and Weiss [33] introduced a now classical parking protocol. The deterministic process and its resultant objects, known as parking functions, have since become a favorite object of study in enumerative combinatorics. In our…
Consider a uniform random rooted tree on vertices labelled by $[n] = \{1,2,\ldots,n\}$, with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number $m \le n$ of cars arrive one by…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
An asymmetric exclusion process type process, where cars move forward along a closed road that starts and terminates at a parking garage, displays dynamic phase transitions into two types of condensate phases where the garage becomes…
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. In part I, we studied the behavior of coefficients in the partial fraction decomposition of this…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
Let A be any set of positive integers and n a positive integer. A composition of n with parts in A is an ordered collection of one or more elements in A whose sum is n. We derive generating functions for the number of compositions of n with…
In smart cities, it is common practice to define a maximum length of stay for a given parking space to increase the space's rotativity and discourage the usage of individual transportation solutions. However, automatically determining…
Let $(A_u : u \in \mathbb{B})$ be i.i.d.~non-negative integers that we interpret as car arrivals on the vertices of the full binary tree $ \mathbb{B}$. Each car tries to park on its arrival node, but if it is already occupied, it drives…
Given an integer $k\ge2$, let $\omega_k(n)$ denote the number of primes that divide $n$ with multiplicity exactly $k$. We compute the density $e_{k,m}$ of those integers $n$ for which $\omega_k(n)=m$ for every integer $m\ge0$. We also show…