Enumeration of certain young tableaux with bounded height

We consider Young tableaux strictly increasing in rows, weakly increasing in columns, and each column having an even number of elements. We show that the number of such tableaux with entries between 1 and n, and having at most 2k rows, is the product . The proof is mainly bijective, using configurat...

Full description

Saved in:
Bibliographic Details
Main Authors: Desainte-Catherine, Myriam, Viennot, Gérard
Format: Book Chapter
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider Young tableaux strictly increasing in rows, weakly increasing in columns, and each column having an even number of elements. We show that the number of such tableaux with entries between 1 and n, and having at most 2k rows, is the product . The proof is mainly bijective, using configurations of non-crossing paths. At the end we need the qd-algorithm from Padé approximants theory.
ISSN:0075-8434
1617-9692
DOI:10.1007/BFb0072509