Related papers: Some bijective correspondences involving domino ta…
The classical Robinson--Schensted--Knuth correspondence is a bijection from nonnegative integer matrices to pairs of semi-standard Young tableaux. Based on the work of, among others, Burge, Hillman, Grassl, Knuth and Gansner, it is known…
Recently, in papers by Knutson, Tao and Woodward, Henriques and Kamnitzer, Pak and Vallejo have been constructed several interesting bijections of associativity and commutativity. In the first two papers bijections relate special sets of…
We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…
We define a set of operations called crystal operations on matrices with entries either in {0,1} or in N. There are horizontal and vertical crystal operations, giving rise to two commuting structures of a crystal graph on these matrices.…
A new combinatorial approach to the ribbon tableaux generating functions and q-Littlewood Richardson coefficients of Lascoux, Leclerc and Thibon is suggested. We define operators which add ribbons to partitions and following Fomin and…
We provide two shifted analogues of the tableau switching process due to Benkart, Sottile, and Stroomer, the shifted tableau switching process and the modified shifted tableau switching process. They are performed by applying a sequence of…
Based on \cite{DH94}, we introduce a bijective correspondence between first order differential calculi and the graph structure of the symmetric lattice that allows one to encode completely the interconnection structure of the graph in the…
Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…
The RSK correspondence generalises the Robinson-Schensted correspondence by replacing permutation matrices by matrices with entries in ${\bf N}$, and standard Young tableaux by semistandard ones. For $r>0$, the Robinson-Schensted…
Super RSK correspondence is a bijective correspondence between superbiwords and pairs of semistandard supertableaux. Such a bijection was given by Bonetti, Senato and Venezia, via an insertion algorithm closely related to Schensted…
We present a bijection between vacillating tableaux and pairs consisting of a standard Young tableau and an orthogonal Littlewood-Richardson tableau for the special orthogonal group $\mathrm{SO}(2k+1)$. This bijection is motivated by the…
We give a new formula for the Littlewood--Richardson coefficients in terms of peelable tableaux compatible with shuffle tableaux, in the same fashion as Remmel--Whitney rule. This gives an efficient way to compute generalized…
By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…
The numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…
Rowmotion is an invertible operator on the order ideals of a poset which has been extensively studied and is well understood for the rectangle poset. In this paper, we show that rowmotion is equivariant with respect to a bijection of…
We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be expected from symmetric functions arising from representations…
Based on Sch\"utzenberger's evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function…
We study "cominuscule tableau combinatorics" by generalizing constructions of M. Haiman, S. Fomin and M.-P. Sch\"utzenberger. In particular, we extend the dual equivalence ideas of [Haiman, 1992] to reformulate the generalized…
Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…
We define piecewise-linear and birational analogues of the toggle-involutions on order ideals of posets studied by Striker and Williams and use them to define corresponding analogues of rowmotion and promotion that share many of the…