Related papers: A Shifted Parking Function Symmetric Function
A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…
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.
A parking function $(c_1,\ldots,c_n)$ can be viewed as having $n$ cars trying to park on a one-way street with $n$ parking spots, where car $i$ tries to park in spot $c_i$, and otherwise he parks in the leftmost available spot after $c_i$.…
The classical algebra $\Lambda$ of symmetric functions has a remarkable deformation $\Lambda^*$, which we call the algebra of shifted symmetric functions. In the latter algebra, there is a distinguished basis formed by shifted Schur…
If the moments of a probability measure on $\R$ are interpreted as a specialization of complete homogeneous symmetric functions, its free cumulants are, up to sign, the corresponding specializations of a sequence of Schur positive symmetric…
In this paper, let $\mathcal{P}_{n,n+k;\leq n+k}$ (resp. $\mathcal{P}_{n;\leq s}$) denote the set of parking functions $\alpha=(a_1,...,a_n)$ of length $n$ with $n+k$ (respe. $n$)parking spaces satisfying $1\leq a_i\leq n+k$ (resp. $1\leq…
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,…
We introduce a shifted analog of the plactic monoid of Lascoux and Sch\"utzenberger, the \emph{shifted plactic monoid}. It can be defined in two different ways: via the \emph{shifted Knuth relations}, or using Haiman's mixed insertion.…
Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous spots, before proceeding forward as usual. In this work…
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…
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…
Consider the algebra Q<<x_1,x_2,...>> of formal power series in countably many noncommuting variables over the rationals. The subalgebra Pi(x_1,x_2,...) of symmetric functions in noncommuting variables consists of all elements invariant…
We recall that a parking function of length $n+1$ is said to be prime if removing any instance of 1 yields a parking function of length $n$. In this article, we study prime parking functions from multiple lenses. We derive an explicit…
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…
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…
The displacement of a parking function measures the total difference between where cars want to park and where they ultimately park. In this article, we prove that the set of parking functions of length $n$ with displacement one is in…
The conceptions of $G$-parking functions and $G$-multiparking functions were introduced in [15] and [12] respectively. In this paper, let $G$ be a connected graph with vertex set $\{1,2,...,n\}$ and $m\in V(G)$. We give the definition of…
The original Shuffle Conjecture of Haglund et al. has a symmetric function side and a combinatorial side. The symmetric function side may be simply expressed as $<\nabla e_n, h_{\mu}>$ where \nabla is the Macdonald polynomial eigen-operator…
Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a…
In a parking function, a lucky car is a car that parks in its preferred parking spot and the parking outcome is the permutation encoding the order in which the cars park on the street. We give a characterization for the set of parking…