English
Related papers

Related papers: Parking functions and Haglund--Loehr data

200 papers

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…

Combinatorics · Mathematics 2025-07-29 Stephan Wagner , Catherine H. Yan , Mei Yin

We prove here that the polynomial <nabla(C_p(1)), e_a h_b h_c> q, t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p of size a + b + c and…

Combinatorics · Mathematics 2013-05-10 Adriano M. Garsia , Guoce Xin , Mike Zabrocki

Motivated by the combinatorics of parking functions and their several generalizations, we study the Ehrhart theory of Pitman--Stanley polytopes. We prove a strong positivity phenomenon called \emph{magic positivity} for the Ehrhart…

Combinatorics · Mathematics 2026-04-09 Nicolas Avila , Luis Ferroni , Alejandro H. Morales

We construct an action of the braid group on $n$ strands on the set of parking functions of $n$ cars such that elementary braids have orbits of length 2 or 3. The construction is motivated by a theorem of Lyashko and Looijenga stating that…

Representation Theory · Mathematics 2013-09-23 Evgeny Gorsky , Mikhail Gorsky

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…

Combinatorics · Mathematics 2024-11-08 Thomas Selig , Haoyue Zhu

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…

Physics and Society · Physics 2019-10-01 Kexin Xie , Myron Hlynka

In this article, we establish new results on the probabilistic parking model (introduced by Durm\'ic, Han, Harris, Ribeiro, and Yin) with $m$ cars and $n$ parking spots and probability parameter $p\in[0,1]$. For any $ m \leq n$ and $p \in…

Probability · Mathematics 2025-02-04 Pamela E. Harris , Rodrigo Ribeiro , Mei Yin

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…

Combinatorics · Mathematics 2016-09-07 Leonard M. Smiley

Let A be a set of integers. For every integer n, let r_{A,h}(n) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,...,a_h are in A and a_1 \leq a_2 \leq ... \leq a_h. The function r_{A,h}: Z \to…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Parke-Taylor functions are certain rational functions on the Grassmannian of lines encoding MHV amplitudes in particle physics. For $n$ particles there are $n!$ Parke-Taylor functions, corresponding to all orderings of the particles. Linear…

Algebraic Geometry · Mathematics 2025-09-12 Benjamin Hollering , Dmitrii Pavlov

We give an exact enumerative formula for the minimal acyclic deterministic finite automata. This formula is obtained from a bijection between a family of generalized parking functions and the transitions functions of acyclic automata.

Combinatorics · Mathematics 2015-05-07 Jean-Baptiste Priez

Let $\mathfrak{S}_n$ denote the symmetric group and let $W(\mathfrak{S}_n)$ denote the weak order of $\mathfrak{S}_n$. Through a surprising connection to a subset of parking functions, which we call unit Fubini rankings, we provide a…

Combinatorics · Mathematics 2025-06-23 Jennifer Elder , Pamela E. Harris , Jan Kretschmann , J. Carlos Martínez Mori

The modified Macdonald polynomials introduced by Garsia and Haiman (1996) have many remarkable combinatorial properties. One such class of properties involves applying the $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric…

Combinatorics · Mathematics 2018-04-18 Emily Sergel

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

Logic in Computer Science · Computer Science 2008-08-06 Paul Tarau

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

In this paper, we explore parking distributions on caterpillar trees, focusing on two primary statistics: the number of lucky cars and the frequency with which cars prefer specific parking spaces. We use first-return decomposition to reveal…

Combinatorics · Mathematics 2025-09-03 Amanuel T. Getachew

It is well noted that coordinate based MLPs benefit -- in terms of preserving high-frequency information -- through the encoding of coordinate positions as an array of Fourier features. Hitherto, the rationale for the effectiveness of these…

Machine Learning · Computer Science 2021-10-13 Jianqiao Zheng , Sameera Ramasinghe , Simon Lucey

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…

Combinatorics · Mathematics 2026-03-17 Richard Ehrenborg , Gábor Hetyei , Margaret Readdy

The modified Macdonald polynomials, introduced by Garsia and Haiman (1996), have many astounding combinatorial properties. One such class of properties involves applying the related $\nabla$ operator of Bergeron and Garsia (1999) to basic…

Combinatorics · Mathematics 2016-03-02 Emily Sergel Leven

We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.

Rings and Algebras · Mathematics 2011-03-02 Loïc Foissy