AbstractThe Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of tableaux, is investigated. The representation, in the tableau, of the dihedral symmetries of the matrix are derived in a simple manner using a shape-preserving anti-isomorphism of the platic monoid. The Robinson-Schensted correspondence is shown to be equivalent to the Hillman-Grassl bijection between reverse plane partitions and tabloids. A generalized insertion method for the Robinson-Schensted correspondence is obtained
AbstractWe introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. Th...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
AbstractWe make a systematic study of a new concept in the theory of jeu-de-taquin, which we call du...
AbstractThe Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of ...
The Robinson-Schensted-Knuth correspondence (RSK, see [8] and Corol-lary 2.5 below) is a bijection b...
Robinson–Schensted–Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays...
We extend the Robinson-Schensted-Knuth insertion procedure to tableaux over totally ordered sets and...
AbstractGiven partitions R and S with the same weight, the Robinson-Schensted-Knuth correspondence e...
We consider pictures as defined by Zelevinsky. We elaborate on the generalisation of the Robinson-Sc...
Abstract: Given partitions R and S with the same weight, the Robinson-Schens-ted-Knuth correspondenc...
Schensted [C’anad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspondence be...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
AbstractIn this paper, we study the combinatorics related to complements of tableaux. Using the repr...
AbstractWe introduce an analog of the Robinson-Schensted algorithm for skew oscillating tableaux whi...
AbstractWe introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. Th...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
AbstractWe make a systematic study of a new concept in the theory of jeu-de-taquin, which we call du...
AbstractThe Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of ...
The Robinson-Schensted-Knuth correspondence (RSK, see [8] and Corol-lary 2.5 below) is a bijection b...
Robinson–Schensted–Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays...
We extend the Robinson-Schensted-Knuth insertion procedure to tableaux over totally ordered sets and...
AbstractGiven partitions R and S with the same weight, the Robinson-Schensted-Knuth correspondence e...
We consider pictures as defined by Zelevinsky. We elaborate on the generalisation of the Robinson-Sc...
Abstract: Given partitions R and S with the same weight, the Robinson-Schens-ted-Knuth correspondenc...
Schensted [C’anad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspondence be...
We present an analog of the Robinson-Schensted correspondence that applies to shifted Young tableaux...
AbstractWe present an analog of the Robinson-Schensted correspondence that applies to shifted Young ...
AbstractIn this paper, we study the combinatorics related to complements of tableaux. Using the repr...
AbstractWe introduce an analog of the Robinson-Schensted algorithm for skew oscillating tableaux whi...
AbstractWe introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. Th...
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they...
AbstractWe make a systematic study of a new concept in the theory of jeu-de-taquin, which we call du...