Oscillating tableaux are certain walks in Young's lattice of partitions; they generalize standard Young tableaux. The shape of an oscillating tableau is the last partition it visits and the length of an oscillating tableau is the number of steps it takes. We define a new statistic for oscillating tableaux that we call weight: the weight of an oscillating tableau is the sum of the sizes of all the partitions that it visits. We show that the average weight of all oscillating tableaux of shape λ and length |λ| + 2n (where |λ| denotes the size of λ and n ∈ N) has a surprisingly simple formula: it is a quadratic polynomial in |λ| and n. Our proof via the theory of differential posets is largely computational. We suggest how the homomesy paradig...
AbstractGian-Carlo's powerfull Umbral calculus, suitably automated, is used to enumerate large famil...
We examine properties of Young tableaux of shape λ and weight μ or of shape {λ(i)}, a sequence of pa...
International audienceTableau sequences of bounded height have been central to the analysis of $k$-n...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
AbstractWe prove a q-analog of the following result due to McKay, Morse and Wilf: the probability th...
A fundamental identity in the representation theory of the partition algeba is $n^k = \sum_{\lambda}...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
Walks on Young's lattice of integer partitions encode many objects of algebraic and combina-torial i...
Walks on Young's lattice of integer partitions encode many objects of algebraic and combina-torial i...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
AbstractWe consider an analogue of the Robinson–Schensted correspondence for skew oscillating tablea...
AbstractThe height of a trace is the height of the corresponding heap of pieces in Viennot's represe...
AbstractGian-Carlo's powerfull Umbral calculus, suitably automated, is used to enumerate large famil...
We examine properties of Young tableaux of shape λ and weight μ or of shape {λ(i)}, a sequence of pa...
International audienceTableau sequences of bounded height have been central to the analysis of $k$-n...
AbstractChen et al. recently established bijections for (d+1)-noncrossing/nonnesting matchings, osci...
AbstractWe prove a q-analog of the following result due to McKay, Morse and Wilf: the probability th...
A fundamental identity in the representation theory of the partition algeba is $n^k = \sum_{\lambda}...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
Walks on Young's lattice of integer partitions encode many objects of algebraic and combina-torial i...
Walks on Young's lattice of integer partitions encode many objects of algebraic and combina-torial i...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
AbstractThis work is first concerned with some properties of the Young–Fibonacci insertion algorithm...
In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer se...
AbstractWe consider an analogue of the Robinson–Schensted correspondence for skew oscillating tablea...
AbstractThe height of a trace is the height of the corresponding heap of pieces in Viennot's represe...
AbstractGian-Carlo's powerfull Umbral calculus, suitably automated, is used to enumerate large famil...
We examine properties of Young tableaux of shape λ and weight μ or of shape {λ(i)}, a sequence of pa...
International audienceTableau sequences of bounded height have been central to the analysis of $k$-n...