An analog of Schensted's algorithm for Shifted Young Tableaux |
| |
| Authors: | Bruce Sagan |
| |
| Institution: | Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 USA |
| |
| Abstract: | Schensted Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspondence between permutations and pairs of Young Tableaux. The author develops an analogous algorithm relating permutations and triples consisting of two Shifted Tableaux and a set. Various properties of this algorithm are also examined. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
