• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.485-494
• /
• 2008

There are two well known reduction formulae for structural constants of the cohomology ring of Grassmannians, i.e., Littlewood-Richardson coefficients. Two reduction formulae are a conjugate pair in the sense that indexing partitions of one formula are conjugate to those of the other formula. A nice bijective proof of the first reduction formula is given in the authors' previous paper while a (combinatorial) proof for the second reduction formula in the paper depends on the identity between Littlewood-Richardson coefficients of conjugate shape. In this article, a direct bijective proof for the second reduction formula for Littlewood-Richardson coefficients is given. Our proof is independent of any previously known results (or bijections) on tableaux theory and supplements the arguments on bijective proofs of reduction formulae in the authors' previous paper.

• Honam Mathematical Journal
• /
• v.32 no.2
• /
• pp.271-281
• /
• 2010

Inspired by the reduction formulae between intersection numbers on Grassmannians obtained by Griffiths-Harris and the factorization theorem of Littlewood-Richardson coefficients by King, Tollu and Toumazet, eight reduction formulae has been discovered by the author and others. In this paper, we prove r = 1 reduction formula by constructing a bijective map between suitable sets of Littlewood-Richardson tableaux.

• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1197-1222
• /
• 2010

There is a well-known classical reduction formula by Griffiths and Harris for Littlewood-Richardson coefficients, which reduces one part from each partition. In this article, we consider an extension of the reduction formula reducing two parts from each partition. This extension is a special case of the factorization theorem of Littlewood-Richardson coefficients by King, Tollu, and Toumazet (the KTT theorem). This case of the KTT factorization theorem is of particular interest, because, in this case, the KTT theorem is simply a reduction formula reducing two parts from each partition. A bijective proof using tableaux of this reduction formula is given in this paper while the KTT theorem is proved using hives.

• Journal of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.947-984
• /
• 2019

We provide two shifted analogues of the tableau switching process due to Benkart, Sottile, and Stroomer; the shifted tableau switching process and the modified shifted tableau switching process. They are performed by applying a sequence of elementary transformations called switches and shares many nice properties with the tableau switching process. For instance, the maps induced from these algorithms are involutive and behave very nicely with respect to the lattice property. We also introduce shifted generalized evacuation which exactly agrees with the shifted J-operation due to Worley when applied to shifted Young tableaux of normal shape. Finally, as an application, we give combinatorial interpretations of Schur P- and Schur Q-function related identities.