RUS  ENG
Full version
JOURNALS // Uspekhi Matematicheskikh Nauk // Archive

Uspekhi Mat. Nauk, 2005 Volume 60, Issue 2(362), Pages 79–142 (Mi rm1402)

This article is cited in 24 papers

Arrays and the combinatorics of Young tableaux

V. I. Danilov, G. A. Koshevoy

Central Economics and Mathematics Institute, RAS

Abstract: The classical theory of Young tableaux is presented in the rather new and non-traditional language of arrays. With the usual operations (or algorithms) of insertion and jeu de taquin as a starting point, more elementary operations on arrays are introduced. The set of arrays equipped with these operations forms an object which can be referred to as a bicrystal. This formalism is presented in the first part of the paper, and its exposition is based on the theorem that the vertical and horizontal operators commute. In the second part the apparatus of arrays is used to present some topics in the theory of Young tableaux, namely, the plactic monoid, Littlewood–Richardson rule, Robinson–Schensted–Knuth correspondence, dual tableaux, plane partitions, and so on.

UDC: 519.116+519.142.1

MSC: Primary 05E05; Secondary 05B30, 05E05

Received: 14.07.2004

DOI: 10.4213/rm1402


 English version:
Russian Mathematical Surveys, 2005, 60:2, 269–334

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025