English
Related papers

Related papers: A Parking Function Bijection supporting the Haglun…

200 papers

We introduce a new approach to the enumeration of rational slope parking functions with respect to the area and a generalized dinv statistics, and relate the combinatorics of parking functions to that of affine permutations. We relate our…

Combinatorics · Mathematics 2016-09-30 Eugene Gorsky , Mikhail Mazin , Monica Vazirani

We show that a minimal triangulation of the associahedron (Stasheff polytope) of dimension n is made of (n+1)^{n-1} simplices. We construct a natural bijection with the set of parking functions from a new interpretation of parking functions…

Algebraic Topology · Mathematics 2007-05-23 Jean-Louis Loday

A parking function is a sequence of N nonnegative integers majorated by a permutation of the set {0, ..., N-1}. We provide a way to encode parking functions by data suggested by J.Haglund and N.Loehr. This coding is compared with another…

Combinatorics · Mathematics 2007-05-23 Yurii M. Burman

In the context of the shuffle theorem, many classical integer sequences appear with a natural refinement by two statistics $q$ and $t$: for example the Catalan and Schr\"oder numbers. In particular, the bigraded Hilbert series of diagonal…

Combinatorics · Mathematics 2024-03-29 Sylvie Corteel , Matthieu Josuat-Vergès , Anna Vanden Wyngaerd

This paper studies a generalization of parking functions named $k$-Naples parking functions, where backward movement is allowed. One consequence of backward movement is that the number of ascending $k$-Naples is not the same as the number…

Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…

Combinatorics · Mathematics 2014-03-04 Jason Fulman

Back in the nineties Pak and Stanley introduced a labeling of the regions of a k-Shi arrangement by k-parking functions and proved its bijectivity. Duval, Klivans, and Martin considered a modification of this construction associated with a…

Combinatorics · Mathematics 2015-01-07 Mikhail Mazin

Walks in the plane taking unit-length steps north and east from $(0,0)$ to $(n,n)$ never dropping below $y=x$ and parking cars subject to preferences are two intriguing ingredients in a formula conjectured in 2005, now famously known as the…

Combinatorics · Mathematics 2019-05-20 Stephanie van Willigenburg

In 1980, G. Kreweras gave a recursive bijection between forests and parking functions. In this paper we construct a nonrecursive bijection from forests onto parking functions, which answers a question raised by R. Stanley. As a by-product,…

Combinatorics · Mathematics 2008-10-03 Heesung Shin

The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize…

Combinatorics · Mathematics 2014-03-10 Drew Armstrong , Nicholas A. Loehr , Gregory S. Warrington

We resolve affirmatively some conjectures of Reiner, Stanton, and White \cite{ReinerComm} regarding enumeration of transportation matrices which are invariant under certain cyclic row and column rotations. Our results are phrased in terms…

Combinatorics · Mathematics 2010-05-17 Brendon Rhoades

There are several combinatorial objects that are known to be in bijection to the spanning trees of a graph G. These objects include G-parking functions, critical configurations of G, and descending traversals of G. In this paper, we extend…

Combinatorics · Mathematics 2007-05-23 Dimitrije Kostic

Haglund's conjecture states that $\dfrac{\langle J_{\lambda}(q,q^k),s_\mu \rangle}{(1-q)^{|\lambda|}} \in \mathbb{Z}_{\geq 0}[q]$ for all partitions $\lambda,\mu$ and all non-negative integers $k$, where $J_{\lambda}$ is the integral form…

Combinatorics · Mathematics 2022-06-10 Aritra Bhattacharya

Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…

Combinatorics · Mathematics 2021-04-01 Richard Kenyon , Mei Yin

The \emph{Shi arrangement} is the set of all hyperplanes in $\mathbb R^n$ of the form $x_j - x_k = 0$ or $1$ for $1 \le j < k \le n$. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this…

We conjecture a combinatorial formula for the monomial expansion of the image of any Schur function under the Bergeron-Garsia nabla operator. The formula involves nested labeled Dyck paths weighted by area and a suitable "diagonal…

Combinatorics · Mathematics 2007-06-01 Nicholas A. Loehr , Gregory S. Warrington

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

Combinatorics · Mathematics 2023-09-29 Per Alexandersson , Ryan Mickler

Stanley recently introduced the shifted parking function symmetric function $SH_n$, which is the shiftification of Haiman's parking function symmetric function $PF_n$. The function $SH_n$ lives in the subalgebra of symmetric functions…

Combinatorics · Mathematics 2025-05-19 Zachary Hamaker , Jesse Kim

Graphical parking functions, or $G$-parking functions, are a generalization of classical parking functions which depend on a connected multigraph $G$ having a distinguished root vertex. Gaydarov and Hopkins characterized the relationship…

Combinatorics · Mathematics 2025-09-19 Lauren Snider , Catherine Yan

Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…

Combinatorics · Mathematics 2021-10-06 Mei Yin