Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

A BUMPING ALGORITHM ON THE SHIFTED RIM HOOK TABLEAUX

  • Lee, Jae-Jin (Department of Mathematics Hallym University)
  • Published : 1999.09.01

⟨ Previous Next ⟩

Abstract

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.

Keywords

References

  1. J. Combin. Theory. A v.43 A Schensted-type correspondence for the symplectic group A.Berele
  2. The Art of Computer Programming v.3 Sorting and Searching D.E.Knuth
  3. Pacific J. Math. v.34 Permutations, matrices, and generalized Young tableaux D.E.Knuth
  4. J. Korean Math. Soc. v.31 A Schensted Algorithm for Shifted Rim Hook Tableaux Jaejin Lee
  5. J. Combin. Theory (A) v.45 Shifted tableaux, Schur Q-functions and a conjecture of R.Stanley B.E.Sagan
  6. Canad. J. Math. v.13 Longest incerasing and decreasing subsequences C.Schensted
  7. J. Combin. Theory (A) Robinson-Schensted algorithms for skew tableaux B.Sagan;R.Stanley
  8. J. Combin. Theory (A) v.40 A Schensted algorithm for rim hook tableaux D.W.Stanton;D.E.White
  9. Advances in Math. v.50 A bijection proving orthogonality of the characters of $S_n$ D.E.White
  10. Ph. D. thesis, M.I.T. A theory of Shifted Young Tableaux D.R.Worley