Related papers: Set-Valued Young Tableaux and Product-Coproduct Pr…

We study the monoid algebra ${}_{n}\mathcal{T}_{m}$ of semistandard Young tableaux, which coincides with the Gelfand--Tsetlin semigroup ring $\mathcal{GT}_{n}$ when $m = n$. Among others, we show that this algebra is commutative,…

We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper [Re], we start with probability distributions on the space of the infinite Young…

Let $P$ be the Gelfand--Tsetlin polytope defined by the skew shape $\lambda/\mu$ and weight $w$. In the case corresponding to a standard Young tableau, we completely characterize for which shapes $\lambda/\mu$ the polytope $P$ is integral.…

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

A Littlewood identity is an identity equating a sum of Schur functions with an infinite product. A bounded Littlewood identity is one where the sum is taken over the partitions with a bounded number of rows or columns. The price to pay is…

The $k$-Young lattice $Y^k$ is a partial order on partitions with no part larger than $k$. This weak subposet of the Young lattice originated from the study of the $k$-Schur functions(atoms) $s_\lambda^{(k)}$, symmetric functions that form…

We introduce lecture hall tableaux, which are fillings of a skew Young diagram satisfying certain conditions. Lecture hall tableaux generalize both lecture hall partitions and anti-lecture hall compositions, and also contain reverse…

We describe one-dimensional central measures on numberings (tableaux) of ideals of partially ordered sets (posets). As the main example, we study the poset ${\Bbb Z}_+^d$ and the graph of its finite ideals, multidimensional Young tableaux;…

We study vectors formed by entries on the diagonal of standard Young tableaux of shifted shapes. Such vectors are in bijection with integer lattice points of certain integral polytopes, which are Minkowski sums of simplices. We also…

We present a bijective proof of the hook-length formula for shifted standard tableaux of a fixed shape based on a modified jeu de taquin and the ideas of the bijective proof of the hook-length formula for ordinary standard tableaux by…

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

As a natural generalization of permutations, transversals of Young diagrams play an important role in the study of pattern avoiding permutations. Let $\mathcal{T}_{\lambda}(\tau)$ and $\mathcal{ST}_{\lambda}(\tau)$ denote the set of…

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…

Introduced by Ardila (J. Combin. Theory Ser. A, 2003), the Catalan matroid is obtained by defining the bases of the matroid using Dyck paths from $(0,0)$ to $(n,n)$. Further research has gone into the topic, with variants like lattice path…

Young tableaux are ubiquitous in various branches of mathematics. There are two counting formulas for standard Young tableaux. The first involves a determinant and goes back to Frobenius and Young, and the second is the hook formula by…

We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…

Young diagrams are fundamental combinatorial objects in representation theory and algebraic geometry. Many constructions that rely on these objects depend on variations of a straightening process that expresses a filling of a Young diagram…

The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…

We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…

A homotopy commutative algebra, or $C_{\infty}$-algebra, is defined via the Tornike Kadeishvili homotopy transfer theorem on the vector space generated by the set of Young tableaux with self-conjugated Young diagrams. We prove that this…