RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 1995 Volume 223, Pages 219–226 (Mi znsl4388)

This article is cited 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.

UDC: 519.117

Received: 15.12.1994

Language: English


 English version:
Journal of Mathematical Sciences (New York), 1997, 87:6, 4118–4123

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024