Related papers: What is a Young tableau?

A tableau inversion is a pair of entries in row-standard tableau $T$ that lie in the same column of $T$ yet lack the appropriate relative ordering to make $T$ column-standard. An $i$-inverted Young tableau is a row-standard tableau along…

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…

We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatorial tools to describe the formula in a purely combinatorial way for type A_n, B_n and C_n. This description is in terms of Young tableaux and…

We introduce the notion of "type" of a tableau, that allows us to define new families of tableaux including both balanced and standard Young tableaux. We use these new objects to describe the set of reduced decompositions of any…

Using Symbolic Computation with Maple, we can discover lots of (rigorously-proved!) facts about Standard Young Tableaux, in particular the distribution of the entries in any specific cell, and the sorting probabilities.

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 introduce and study some affine Hecke algebras of type ADE, generalising the affine Hecke algebras of GL. We construct irreducible calibrated representations and describe the calibrated spectrum. This is done in terms of new families of…

Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…

The number of Young Tableaux whose shape is a k by n rectangle is famously (nk)! 0! ... (k-1)!/((n+k-1)!(n+k-2)!... n!) implying that for each specific k, that sequence satisfies a linear recurrence equation with polynomial coefficients of…

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…

Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey.

The descent-to-peak map serves as a bridge between algebra and combinatorics. We use it as a tool for proving the equidistribution of peak and valley sets of standard Young tableaux with a very short argument. We also introduce a new…

In this work, we introduce new combinatorial objects called Dyck tableaux, which present a natural insertion algorithm. These tools may be useful to describe statistics which are relevant in the study of the physical model named PASEP.

The theory of pictures between posets is known to encode much of the combinatorics of symmetric group representations and related topics such as Young diagrams and tableaux. Many reasons, com-binatorial (e.g. since semi-standard tableaux…

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 consider two questions of Wilf related to Standard Young Tableaux. We provide a partial answer to one question, and that will lead us to a more general answer to the other question. Our answers are purely combinatorial.

Inspired by the the Kourovka Notebook of unsolved problems in group theory [KhukhMaz2024], this is a notebook of unsolved problems in the combinatorics of tableaux. Contributions to the notebook are invited.

Standard set-valued Young tableaux are a generalization of standard Young tableaux where cells can contain unordered sets of integers, with the added condition that every integer at position $(i,j)$ must be smaller that every integer at…

A 0-Hecke algebra is a deformation of the group algebra of a Coxeter group. Based on work of Norton and Krob--Thibon, we introduce a tableau approach to the representation theory of 0-Hecke algebras of type A, which resembles the classic…

This note collects some facts and conjectures about the Hankel determinants and their generating functions of the columns of Hoggatt triangles which apparently are related to combinatorial objects such as Young tableaux and Narayana…