|
This article is cited in 23 scientific papers (total in 23 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.
Received: 14.07.2004
Citation:
V. I. Danilov, G. A. Koshevoy, “Arrays and the combinatorics of Young tableaux”, Uspekhi Mat. Nauk, 60:2(362) (2005), 79–142; Russian Math. Surveys, 60:2 (2005), 269–334
Linking options:
https://www.mathnet.ru/eng/rm1402https://doi.org/10.1070/RM2005v060n02ABEH000824 https://www.mathnet.ru/eng/rm/v60/i2/p79
|
Statistics & downloads: |
Abstract page: | 1248 | Russian version PDF: | 605 | English version PDF: | 70 | References: | 85 | First page: | 2 |
|