Related papers: From Parking Functions to Gelfand Pairs

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…

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…

Let $W$ be an irreducible finite complex reflection group acting on a complex vector space $V$. For a positive integer $k$, we consider a class function $\varphi_k$ given by $\varphi_k(w) = k^{\dim V^w}$ for $w \in W$, where $V^w$ is the…

Consider $n$ cars $C_1, C_2, \ldots, C_n$ that want to park in a parking lot with parking spaces $1,2,\ldots,n$ that appear in order. Each car $C_i$ has a parking preference $\alpha_i \in \{1,2,\ldots,n\}$. The cars appear in order, if…

The notion of parking sequences is a new generalization of parking functions introduced by Ehrenborg and Happ. In the parking process defining the classical parking functions, instead of each car only taking one parking space, we allow the…

Interval parking functions (IPFs) are a generalization of ordinary parking functions in which each car is willing to park only in a fixed interval of spaces. Each interval parking function can be expressed as a pair $(a,b)$, where $a$ is a…

For a directed graph G on vertices {0,1,...,n}, a G-parking function is an n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty subset U of {1,...,n}, there exists a vertex j in U for which there are more than b_j…

Let $F(n)$ be a connected and simply connected free 2-step nilpotent lie group and $K$ be a compact subgroup of Aut($F(n)$). We say that $(K,F(n))$ is a Gelfand pair when the set of integrable $K$-invariant functions on $F(n)$ forms an…

In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…

We give a very short proof of the fact that the number of $(a,b)$-parking functions of length $n$ equals $a(a+bn)^{n-1}$. This was first proved in 2003 by Kung and Yan, via a very long and torturous route, as a corollary of a more general…

In this paper we introduce an intrinsic version of the classical induction of representations for a subgroup $H$ of a (finite) group $G$, called here {\em geometric induction}, which associates to any, not necessarily transitive, $G$-set…

In 2000, it was demonstrated that the set of $x$-parking functions of length $n$, where $x$=($a,b,...,b$) $\in \mathbbm{N}^n$, is equivalent to the set of rooted multicolored forests on [$n$]=\{1,...,$n$\}. In 2020, Yue Cai and Catherine H.…

A parking function of length $n$ is prime if we obtain a parking function of length $n-1$ by deleting one 1 from it. In this note we give a new direct proof that the number of prime parking functions of length $n$ is $(n-1)^{n-1}$. This…

Let $\Gamma$ be a finite group. Consider the wreath product $G_n := \Gamma^n \rtimes S_n$ and the subgroup $K_n := \Delta_n \times S_n\subseteq G_n$, where $S_n$ is the symmetric group and $\Delta_n$ is the diagonal subgroup of $\Gamma^n$.…

An $(m, n)$-parking function can be characterized as function $f:[n] \to [m]$ such that the partition obtained by reordering the values of $f$ fits inside a right triangle with legs of length $m$ and $n$. Recent work by McCammond, Thomas,…

We apply the concept of parking functions to rooted labelled trees and functional digraphs of mappings (i.e., functions $f : [n] \to [n]$) by considering the nodes as parking spaces and the directed edges as one-way streets: Each driver has…

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…

Suppose that $n$ drivers each choose a preferred parking space in a linear car park with $m$ spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with larger number (if…

We extend the notion of parking functions to parking sequences, which include cars of different sizes, and prove a product formula for the number of such sequences.

We explore the link between combinatorics and probability generated by the question "What does a random parking function look like?" This gives rise to novel probabilistic interpretations of some elegant, known generating functions. It…