#### Filter Results:

#### Publication Year

1996

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The RSK correspondence generalises the Robinson-Schensted correspondence by replacing permutation matrices by matrices with entries in N, and standard Young tableaux by semistandard ones. For r ∈ N >0 , the Robinson-Schensted correspondence can be trivially extended, using the r-quotient map, to one between r-coloured permutations and pairs of standard… (More)

We elaborate on the results in [CaLe]. We give bijective proofs of a number of identities that were established there, in particular between the Yamanouchi domino tableaux and the Littlewood-Richardson tableaux that correspond to the same tensor product decomposition. The oldest form of the Robinson-Schensted correspondence, given in [Rob], associates to… (More)

An overview is provided of some of the basic facts concerning rim hook lattices and ribbon tableaux, using a representation of partitions by their edge sequences. An action is defined of the affine Coxeter group of type˜A r−1 on the r-rim hook lattice, and thereby on the sets of standard and semistandard r-ribbon tableaux, and this action is related to the… (More)

Page 2, §1.1: " the the action " → " the action " .

The following text is an annotation to Marc A. A. van Leeuwen's paper " Tableau algorithms defined naturally for pictures " in its version of 25 November 2011. This annotation contains corrections of a few mistakes. Different comments are separated by horizontal lines, like this: Page 1, §1: Replace " as a tableaux " by " as tableaux ". Page 3, §2.2:… (More)

The conjugacy classes of nilpotent n × n matrices can be parametrised by partitions λ of n, and for a nilpotent η in the class parametrised by λ, the variety Fη of η-stable flags has its irreducible components parametrised by the standard Young tableaux of shape λ. We indicate how several algorithmic constructions defined for Young tableaux have… (More)

We give a bijective proof of the Aztec diamond theorem, stating that there are 2 n(n+1)/2 domino tilings of the Aztec diamond of order n. The proof in fact establishes a similar result for non-intersecting families of n + 1 Schröder paths, with horizontal, diagonal or vertical steps, linking the grid points of two adjacent sides of an n × n square grid;… (More)

We introduce a set of operations that we call crystal operations on matrices with entries either in {0, 1} or in N. There are horizontal and vertical forms of these operations, which commute with each other, and they give rise to two different structures of a crystal graph of type A on these sets of matrices. They provide a new perspective on many aspects… (More)

This document describes CWEBx3.0, a particular implementation of CWEB, a system that supports the concept of " literate programming " for programs written in the language C (more particularly for this version, in ANSI/ISO C). As this manual aims to supply all information possibly relevant to a wide variety of users, it is necessarily rather extensive.… (More)

- Marc A. A. van Leeuwen, Arjeh M. Cohen, Bert Lisser, LıE LıE
- 2009