16 citations · 87 across the 28 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.CO2009
Signed enumeration of ribbon tableaux
Dominique Gouyou-Beauchamps, Philippe Nadeau
We give an extension of the classical Schensted correspondence to the case of ribbon tableaux, where ribbons are allowed to be of different sizes. This is done by extending Fomin's…
math.CO2009★ 11 cited
The structure of alternative tableaux
Philippe Nadeau
In this paper we study alternative tableaux introduced by Viennot. These tableaux are in simple bijection with permutation tableaux, defined previously by Postnikov . We exhibit a…
math.CO2009★ 7 cited
A Bijection between well-labelled positive paths and matchings
Olivier Bernardi, Bertrand Duplantier, Philippe Nadeau
A well-labelled positive path of size n is a pair (p,σ) made of a word p=p_1p_2...p_{n-1} on the alphabet {-1, 0,+1} such that the sum of the letters of any prefix is non-negative,…