Related papers: Lehmer Parking Functions and Their Outcomes
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…
Smart-parking solutions use sensors, cameras, and data analysis to improve parking efficiency and reduce traffic congestion. Computer vision-based methods have been used extensively in recent years to tackle the problem of parking lot…
We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial…
Parking functions were classically defined for $n$ cars attempting to park on a one-way street with $n$ parking spots, where cars only drive forward. Subsequently, parking functions have been generalized in various ways, including allowing…
In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more…
We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…
The cluster complex on one hand, parking functions on the other hand, are two combinatorial (po)sets that can be associated to a finite real reflection group. Cluster parking functions are obtained by taking an appropriate fiber product…
We construct new smallest parts partition functions and smallest parts crank functions by considering variations of Bailey's Lemma and conjugate Bailey pairs. The functions we introduce satisfy simple linear congruences modulo $3$ and $5$.…
For a multipartite correlation experiment with an arbitrary number of settings and any spectral type of outcomes at each site, we introduce a single general representation incorporating in a unique manner all Bell-type inequalities for…
An m-ballot path of size n is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my. The set of these paths can be equipped with a lattice structure,…
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,…
Let $W$ be an irreducible real reflection group. Armstrong, Reiner, and the author presented a model for parking functions attached to W and made three increasingly strong conjectures about these objects. The author generalized these…
We present a bijection between two well-known objects in the ubiquitous Catalan family: non-decreasing parking functions and {\L}ukasiewicz paths. This bijection maps the maximal displacement of a parking function to the height of the…
For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…
A parking function of length n is a sequence (b_1, b_2,..., b_n) of nonnegative integers whose nondecreasing rearrangement (a_1, a_2,...,a_n) has the property that a_i < i for every i. A well-known result about parking functions is that the…
Parking functions correspond with preferences of $n$ cars which enter sequentially to park on a one-way street where (1) each car parks in the first available spot greater than or equal to its preference and (2) all cars successfully park.…
This work builds on the notion of record of rooted trees. We provide an alternative definition of parking functions, derive from it a record-preserving bijection between rooted trees and parking functions, and establish a join…
In this paper we present new results on the enumeration of parking functions and labeled forests. We introduce new statistics on parking functions, which are then extended to labeled forests via bijective correspondences. We determine the…
The purpose of this paper is to find an explicit formula and asymptotic estimate for the total number of sum of weighted records over set partitions of $[n]$ in terms of Bell numbers. For that we study the generating function for the number…
We present a new proof of the monomial case of Wilmes' conjecture, which gives a formula for the coarsely-graded Betti numbers of the G-parking function ideal in terms of maximal parking functions of contractions of G. Our proof is via…