• Korean Journal of Mathematics
• /
• v.24 no.3
• /
• pp.469-487
• /
• 2016

In [6] Schensted constructed the Schensted algorithm, which gives a bijection between permutations and pairs of standard tableaux of the same shape. Stanton and White [8] gave analog of the Schensted algorithm for rim hook tableaux. In this paper we give a generalization of Stanton and White's Schensted algorithm for rim hook tableaux. If k is a fixed positive integer, it shows a one-to-one correspondence between all generalized hook permutations $\mathcal{H}$ of size k and all pairs (P, Q), where P and Q are semistandard k-rim hook tableaux and k-rim hook tableaux of the same shape, respectively.