Related papers: A Shifted Parking Function Symmetric Function
In this paper, we develop a continual analog of decomposition over orthogonal bases in spaces generated by equidistant shifts of a single function. By doing so, we obtain an explicit expression for best approximation by spaces of shifts in…
Classical parking functions are defined as the parking preferences for $n$ cars driving (from west to east) down a one-way street containing parking spaces labeled from $1$ to $n$ (from west to east). Cars drive down the street toward their…
Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…
Warning. The reading of this paper will send you down many winding roads toward new and exciting research topics enumerating generalized parking functions. Buckle up!
We introduce the multiple zeta functions with structures similar to those of symmetric functions such as Schur $P$-, Schur $Q$-, symplectic and orthogonal functions in the representation theory. We first consider their basic properties such…
We construct a generalization of the theory of symmetric functions involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal…
Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $\pi$ angle of the skew…
For a labeled, rooted tree with edges oriented towards the root, we consider the vertices as parking spots and the edge orientation as a one-way street. Each driver, starting with her preferred parking spot, searches for and parks in the…
By considering type B analogs of permutations and tableaux, we extend abstract dual equivalence to type B in two directions. In one direction, we define involutions on signed permutations and shifted tableaux that give a weak dual…
We describe generating functions for several important families of classical symmetric functions and shifted Schur functions. The approach is originated from vertex operator realization of symmetric functions and offers a unified method to…
Parking functions, classically defined in terms of cars with preferred parking spots on a directed path attempting to park there, arise in many combinatorial situations and have seen various generalizations. In particular, parking functions…
Berget and Rhoades asked whether the permutation representation obtained by the action of $S_{n-1}$ on parking functions of length $n-1$ can be extended to a permutation action of $S_{n}$. We answer this question in the affirmative. We…
We give a recursive definition of generalized parking function that allows us to view them as a species. From there we compute a non-commutative characteristic of the generalized parking function module, and deduce some enumeration formulas…
Parking functions were classically defined for $n$ cars attempting to park on a one-way street with $n$ parking spots, where cars only drive forward. Subsequently, parking functions have been generalized in various ways, including allowing…
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…
This paper presents a fast algorithm for projecting a given function to the set of shift orthogonal functions (i.e. set containing functions with unit $L^2$ norm that are orthogonal to their prescribed shifts). The algorithm can be…
A parking function of length $n$ is a sequence $\pi=(\pi_1,\dots, \pi_n)$ of positive integers such that if $\lambda_1\leq\cdots\leq \lambda_n$ is the increasing rearrangement of $\pi_1,\dots,\pi_n$, then $\lambda_i\leq i$ for $1\leq i\leq…
We define two-parameter families of noncommutative symmetric functions and quasi-symmetric functions, which appear to be the proper analogues of the Macdonald symmetric functions in these settings.
We introduce a rather natural family of non-uniform distributions on $PF_n$, $n\in\mathbb{N}$, the set of parking functions of length $n$. One of the motivations for this comes from a similar situation in the context of integer partitions.…
Analogues of classical combinatorial identities for elementary and homogeneous symmetric functions with coefficients in Yanigian are discussed. As a corollary, similar relations are deduced for shifted Schur functions.