Let SY Tn be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SY Tn and some of their crucial properties, we prove three main results: • Intervals in any of these four orders essentially describe the product in a Hopf algebra of tableaux defined by Poirier and Reutenauer. • The map sending a ...

We show that Jn, the Stanley-Reisner ideal of the n-cycle, has a free resolution supported on the (n−3)-dimensional simplicial associahedron An. This resolution is not minimal for n > 6; in this case the Betti numbers of Jn are strictly smaller than the f -vector of An. We show that in fact the Betti numbers βd of Jn are in bijection with the number of standard Young tableaux of shape (d + 1, 2...

Unexpected product formulas for the number of standard Young tableaux of certain truncated shapes are found and proved. These include shifted staircase shapes minus a square in the NE corner, rectangular shapes minus a square in the NE corner, and some variations.

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

This paper introduces calibrated representations for affine Hecke algebras and classifies and constructs all finite-dimensional irreducible calibrated representations. The primary technique is to provide indexing sets for controlling the weight space structure of finite-dimensional modules for the affine Hecke algebra. Using these indexing sets we show that (1) irreducible calibrated representa...

We prove a q-analog, which is valid if q is a positive real number, of the following: the probability that, when n tends to infinity, a randomly chosen standard Young tableau of size n contains a fixed standard Young tableau of shape λ ⊢ k is equal to f λ k! (Journal of Combinatorial Theory Series A, volume 97, 117–128, 2002). We also consider pairs of tableaux.

In the study of lattice walks there are several examples of enumerative equivalences which amount to a trade-o between domain and endpoint constraints. We present a family of such bijections for simple walks in Weyl chambers which use arc diagrams in a natural way. One consequence is a set of new bijections for standard Young tableaux of bounded height. A modi cation of the argument in two dime...

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 positive sum over excited diagrams of products of hook-lengths. We give an algebraic and a combinatorial proof of Naruse’s formula, by using factorial Schur functio...