|
Zapiski Nauchnykh Seminarov POMI, 1995, Volume 223, Pages 219–226
(Mi znsl4388)
|
|
|
|
This article is cited in 16 scientific papers (total in 16 papers)
Combinatorial and algorithmic methods
On the number of rim hook tableaux
S. V. Fomina, Nathan Lulovb a Department of Mathematics, St. Petersburg Institute of Informatics
b Department of Mathematics, Harvard University
Abstract:
A hooklength formula for the number of rim hook tableaux is used to obtain an inequality relating the number of rim hook tableaux of a given shape to the number of standard Young tableaux of the same shape. This provides an upper bound for a certain family of characters of the symmetric group. The analogues for shifted shapes and rooted trees are also given. Bibliography: 13 titles.
Received: 15.12.1994
Citation:
S. V. Fomin, Nathan Lulov, “On the number of rim hook tableaux”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part I, Zap. Nauchn. Sem. POMI, 223, POMI, St. Petersburg, 1995, 219–226; J. Math. Sci. (New York), 87:6 (1997), 4118–4123
Linking options:
https://www.mathnet.ru/eng/znsl4388 https://www.mathnet.ru/eng/znsl/v223/p219
|
Statistics & downloads: |
Abstract page: | 248 | Full-text PDF : | 126 |
|