• Korean Journal of Mathematics
• /
• v.14 no.1
• /
• pp.125-136
• /
• 2006

Using the Bumping algorithm for the shifted rim hook tableaux described in [5], we construct Schensted insertion and deletion algorithms for shifted rim hook tableaux. This may give us the combinatorial proof for the orthogonality of the second kind of the spin characters of $S_n$.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.901-914
• /
• 1999

In [6] Schensted constructed the Schensted algorithm giving a bijection between permutations and pairs of Young standard tableaux. After knuth generalized it to column strict tableaux in [3] various analogs of the Schensted algorithm came. In this paper we describe the bumping algorithm on the shifted rim hook tableaux which is the basic building block of the Schensted algorithm for shifted rim book tableaux.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.551-563
• /
• 2002

We Construct a Sign reversing involution on the Shifted rim hook tableaux with some conditions. Using the Stembridge's combinatorial interpretation for Morris' rule, this involution give a combinatorial proof of the orthogonality of the first kind for the spin characters of $S_{n}$.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.427-438
• /
• 2015

The Schensted algorithm first described by Robinson [5] is a remarkable combinatorial correspondence associated with the theory of symmetric functions. $Sch{\ddot{u}}tzenberger's$ jeu de taquin[10] can be used to give alternative descriptions of both P- and Q-tableaux of the Schensted algorithm as well as the ordinary and dual Knuth relations. In this paper we describe the jeu de taquin on shifted rim hook tableaux using the switching rule, which shows that the sum of the weights of the shifted rim hook tableaux of a given shape and content does not depend on the order of the content if content parts are all odd.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.445-453
• /
• 2007

Using Schensted Insertion and Deletion algorithm for shifted rim hook tableaux described in [7], we construct Schensted algorithm for shifted rim hook tableaux. This give us the combinatorial proof for the orthogonality of the second kind for the spin characters of $\tilde{S}n$.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.445-459
• /
• 1998

Let λ be a partition with all distinct parts. In this paper we give a bijection between the set $\Gamma$$_{λ}$(X) of pairs (equation omitted) satisfying a certain condition and the set $\pi_{λ}$(X) of circled permutation tableaux of shape λ on the set X, where P$\frac{1}{2}$ is a tail circled shifted rim hook tableaux of shape λ and (equation omitted) is a barred permutation on X. Specializing to the partition λ with one part, this bijection gives a combinatorial proof of the Schur identity: $\Sigma$2$\ell$(type($\sigma$)) = 2n! summed over all permutation $\sigma$ $\in$ $S_{n}$ with type($\sigma$) $\in$ O $P_{n}$ . .

• Journal of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.179-203
• /
• 1994