Related papers: Toward a Schurification of Parking Function Formul…
Apr\`es avoir pos\'e les d\'efinitions n\'ecessaires \`a la compr\'ehension du sujet, nous discuterons de statistique d'inversion diagonale dans les $r$-Schr\"oder, de chemins de stationnement dans les $r$-Schr\"oder \`a pente enti\`ere et…
We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…
We present several bijections, in terms of combinatorial objects counted by the Schr\"oder numbers, that are then used (via coloring) for the construction and enumeration of rational Schr\"oder paths with integer slope, ordered rooted…
An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…
We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The…
The shuffle conjecture expresses a relationship between parking functions, diagonal harmonics, and the Bergeron-Garsia $\nabla$ operator. Recent conjectures about a family of modified Hall-Littlewood operators made by Haglund, Morse, and…
We find an explicit $S_n$-equivariant bijection between the integral points in a certain zonotope in $\mathbb{R}^n$, combinatorially equivalent to the permutahedron, and the set of $m$-parking functions of length $n$. This bijection…
In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…
A combinatorial expression for the coefficient of the Schur function $s_{\lambda}$ in the expansion of the plethysm $p_{n/d}^d \circ s_{\mu}$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $\lambda$ is rectangular. In…
We consider a sorting machine consisting of two stacks in series where the first stack has the added restriction that entries in the stack must be in decreasing order from top to bottom. The class of permutations sortable by this machine…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
A randomisation of the Berele insertion algorithm is proposed, where the insertion of a letter to a symplectic Young tableau leads to a distribution over the set of symplectic Young tableaux. Berele's algorithm provides a bijection between…
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…
In this paper, we explore the relationship between quasisymmetric Schur $Q$-functions and peak Young quasisymmetric Schur functions. We introduce a bijection on $\mathsf{SPIT}(\alpha)$ such that $\{\mathrm{w}_{\rm c}(T) \mid T \in…
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,…
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
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…
Associated with the $r$-Shi arrangement and $r$-Catalan arrangement in $\Bbb{R}^n$, we introduce a cubic matrix for each region to establish two bijections in a uniform way. Firstly, the positions of minimal positive entries in column…