Related papers: A New Bijection Between Forests and Parking Functi…

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

This article proposes two different approaches to automatically create a map for valid on-street car parking spaces. For this, we use car sharing park-out events data. The first one uses spatial aggregation and the second a machine learning…

Recall that $\alpha=(a_1,a_2,\ldots,a_n)\in[n]^n$ is a parking function if its nondecreasing rearrangement $\beta=(b_1,b_2,\ldots,b_n)$ satisfies $b_i\leq i$ for all $1\leq i\leq n$. In this article, we study parking functions based on…

In this paper, we shall construct a bijection between rook placements on double staircases (introduced by Josuat-Verg\`es in 2017) and increasing binary trees. We introduce two subclasses of rook placements on double staircases, which we…

In this work, we expose four bijections each allowing to increase (or decrease) one parameter in either uniform random forests with a fixed number of edges and trees, or quadrangulations with a boundary having a fixed number of faces and a…

For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…

In this paper, let $\mathcal{P}_{n;\leq s;k}^l$ denote a set of $k$-flaw preference sets $(a_1,...,a_n)$ with $n$ parking spaces satisfying that $1\leq a_i\leq s$ for any $i$ and $a_1=l$ and $p_{n;\leq s;k}^l=|\mathcal{P}_{n;\leq s;k}^l|$.…

For any irreducible real reflection group $W$ with Coxeter number $h$, Armstrong, Reiner, and the author introduced a pair of $W \times \ZZ_h$-modules which deserve to be called {\sf $W$-parking spaces} which generalize the type A notion of…

In \cite{BaDeFePi96} the concept of nondecreasing Dyck paths was introduced. We continue this research by looking at it from the point of view of words, rational languages, planted plane trees, and continued fractions. We construct a…

Recursive partitioning is the core of several statistical methods including CART, random forest, and boosted trees. Despite the popularity of tree based methods, to date, there did not exist methods for combining multiple trees into a…

We present a bijective proof for the planar case of Louf's counting formula on bipartite planar maps with prescribed face degree, that arises from the Toda hierarchy. We actually show that his formula hides two simpler formulas, both of…

We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects,…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

We illustrate the experimental, empirical, approach to mathematics (that contrary to popular belief, is often rigorous), by using parking functions and their "area" statistic, as a case study. Our methods are purely finitistic and…

We express the toric g-vector entries of any simple polytope as a nonnegative integer linear combination of its gamma-vector entries. We show that the toric g-vector of the associahedron is the ascent statistic of 123-avoiding parking…

A defective $(m,n)$-parking function with defect $d$ is a parking function with $m$ cars attempting to park on a street with $n$ parking spots in which exactly $d$ cars fail to park. We establish a way to compute the defect of a defective…

The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…

Associated with the $r$-Shi arrangement and $r$-Catalan arrangement in $\Bbb{R}^n$, we introduce a cubic matrix for each region to establish two bijections in a uniform way. Firstly, the positions of minimal positive entries in column…