Related papers: A New Bijection Between Forests and Parking Functi…
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…
In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
In 10.1093/imrn/rnac258, the authors conjecture a combinatorial formula for the expressions $\Xi e_\alpha \rvert_{t=1}$, known as Symmetric Theta Trees Conjecture, in terms of tiered trees with an inversion statistic. In…
For any integers $1\leq k\leq n$, we introduce a new family of parking functions called $k$-vacillating parking functions of length $n$. The parking rule for $k$-vacillating parking functions allows a car with preference $p$ to park in the…
The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…
In this paper, let $\mathcal{P}_{n,n+k;\leq n+k}$ (resp. $\mathcal{P}_{n;\leq s}$) denote the set of parking functions $\alpha=(a_1,...,a_n)$ of length $n$ with $n+k$ (respe. $n$)parking spaces satisfying $1\leq a_i\leq n+k$ (resp. $1\leq…
Bressoud introduced the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$, which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the generating function for the partition…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
We test the umbral methods introduced by Rota and Taylor within the theory of representation of symmetric group. We define a simple bijection between the set of all parking functions of length $n$ and the set of all noncrossing partitions…
Based on Sch\"utzenberger's evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function…
We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…
Gibbs-type random probability measures and the exchangeable random partitions they induce represent the subject of a rich and active literature. They provide a probabilistic framework for a wide range of theoretical and applied problems…
Classical parking functions are defined as the parking preferences for $n$ cars driving (from west to east) down a one-way street containing parking spaces labeled from $1$ to $n$ (from west to east). Cars drive down the street toward their…
Random forests have become an established tool for classification and regression, in particular in high-dimensional settings and in the presence of complex predictor-response relationships. For bounded outcome variables restricted to the…
A parking function $(c_1,\ldots,c_n)$ can be viewed as having $n$ cars trying to park on a one-way street with $n$ parking spots, where car $i$ tries to park in spot $c_i$, and otherwise he parks in the leftmost available spot after $c_i$.…
We describe a bijection between $(k,k)$-Fuss-Schr\"oder paths of type $\lambda$ and certain rooted plane forests with $n(k+1)+2$ vertices. This yields a recursion which allows us to analytically enumerate the number of large…
We recall that a parking function of length $n+1$ is said to be prime if removing any instance of 1 yields a parking function of length $n$. In this article, we study prime parking functions from multiple lenses. We derive an explicit…
We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of…
The choice of forward and reverse parking in a parking lot is studied as a stochastic process. An $M/M/c/c$ queueing system is used as an initial framework. We use Monte Carlo simulation to get the relationship between vehicle orientation…