Related papers: From Parking Functions to Gelfand Pairs

Let F_q be the finite field with q elements. Consider the standard embedding GL(n,F_q) -> GL(n+1,F_q). In this paper we prove that for every irreducible representation pi of GL(n+1,F_q) over algebraically closed fields of characteristic…

A classical parking function of length $n$ is a list of positive integers $(a_1, a_2, \ldots, a_n)$ whose nondecreasing rearrangement $b_1 \leq b_2 \leq \cdots \leq b_n$ satisfies $b_i \leq i$. The convex hull of all parking functions of…

The notion of Gelfand pair (G, K) can be generalized if we consider homogeneous vector bundles over G/K instead of the homogeneous space G/K and matrix-valued functions instead of scalar-valued functions. This gives the definition of…

In this work, we consider a family of Gelfand pairs $(K \ltimes N, N)$ (in short $(K,N)$) where $N$ is a two step nilpotent Lie group, and $K$ is the group of orthogonal automorphisms of $N$. This family has a nice analytic property: almost…

Let $\Hn$ be the $(2n+1)$-dimensional Heisenberg group and $K$ a compact group of automorphisms of $\Hn$ such that $(K\ltimes \Hn,K)$ is a Gelfand pair. We prove that the Gelfand transform is a topological isomorphism between the space of…

The Gelfand representation of $\mathcal{S}_n$ is the multiplicity-free direct sum of the irreducible representations of $\mathcal{S}_n$. In this paper, we use a result of Adin, Postnikov, and Roichman to find a recursive generating function…

We introduce parking assortments, a generalization of parking functions with cars of assorted lengths. In this setting, there are $n\in\mathbb{N}$ cars of lengths $\mathbf{y}=(y_1,y_2,\ldots,y_n)\in\mathbb{N}^n$ entering a one-way street…

In this paper, we mainly study two notions of pattern avoidance in parking functions. First, for any collection of length 3 patterns, we compute the number of parking functions of size $n$ that avoid them under the first notion. This is…

We answer an open problem of arXiv:1204.1760 and arXiv:1205.4293, extending their work to irreducible well--generated complex reflection groups $W$. We define a combinatorial $W$-noncrossing parking space and an algebraic $W$-parking space…

Parking sequences (a generalization of parking functions) are defined by specifying car lengths and requiring that a car attempts to park in the first available spot after its preference. If it does not fit there, then a collision occurs…

We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…

We recall that the $k$-Naples parking functions of length $n$ (a generalization of parking functions) are defined by requiring that a car which finds its preferred spot occupied must first back up a spot at a time (up to $k$ spots) before…

Given a positive-integer-valued vector $u=(u_1, \dots, u_m)$ with $u_1<\cdots<u_m$. A $u$-parking function of length $m$ is a sequence $\pi=(\pi_1, \dots, \pi_m)$ of positive integers whose non-decreasing rearrangement $(\lambda_1, \dots,…

The spectrum of a Gelfand pair $(K\ltimes N, K)$, where $N$ is a nilpotent group, can be embedded in a Euclidean space. We prove that in general, the Schwartz functions on the spectrum are the Gelfand transforms of Schwartz $K$-invariant…

We recall that unit interval parking functions of length $n$ are a subset of parking functions in which every car parks in its preference or in the spot after its preference, and Fubini rankings of length $n$ are rankings of $n$ competitors…

We introduce Lehmer parking functions and study their set of parking outcomes. Our main results establish that the number of outcomes of Lehmer parking functions of length $n$ is given by a Bell number, which is exactly the number of set…

In this article the zonal spherical functions of the Gelfand pair $(G(r,d,n), S_n)$ of complex reflection groups will be calculated. After this, a product formula for these spherical functions and a discrete analog of the Laplace operator…

We show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$.

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…

Let $K\leq H$ be two finite groups and let $C\leq A$ be two finite abelian groups, with $H$ acting on $A$ as a group of isomorphisms admitting $C$ as a $K$-invariant subgroup. We study the homogeneous space $X\coloneqq\left(H\ltimes…