activity
19992012
most citedThe Littlewood-Richardson rule, and related combinatorics

41 citations · 48 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2012

A bijection proving the Aztec diamond theorem by combing lattice paths

Frédéric Bosio, Marc A. A. Van Leeuwen

We give a bijective proof of the Aztec diamond theorem, stating that there are domino tilings of the Aztec diamond of order . The proof in fact establishes a simi…

math.CO2010★ 6 cited

Some simple bijections involving lattice walks and ballot sequences

Marc A. A. Van Leeuwen

In this note we observe that a bijection related to Littelmann's root operators (for type ) transparently explains the well known enumeration by length of walks on (left…

math.CO2006

Double crystals of binary and integral matrices

Marc A. A. van Leeuwen

We define a set of operations called crystal operations on matrices with entries either in {0,1} or in N. There are horizontal and vertical crystal operations, giving rise to two c…

math.CO2006

Schur functions and alternating sums

Marc A. A. van Leeuwen

We discuss several well known results about Schur functions that can be proved using cancellations in alternating summations; notably we shall discuss the Pieri and Murnaghan-Nakay…

math.CO2003

Spin-preserving Knuth correspondences for ribbon tableaux

Marc A. A. Van Leeuwen

The RSK correspondence generalises the Robinson-Schensted correspondence by replacing permutation matrices by matrices with entries in , and standard Young tableaux by sem…

math.CO1999

Some bijective correspondences involving domino tableaux

Marc A. A. van Leeuwen

We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an…