Spin-Preserving Knuth Correspondences for Ribbon Tableaux

作者: Marc A. A. Van Leeuwen

DOI: 10.37236/1907

关键词:

摘要: The RSK correspondence generalises the Robinson-Schensted by replacing permutation matrices with entries in ${\bf N}$, and standard Young tableaux semistandard ones. For $r\in{\bf N}_{>0}$, can be trivially extended, using $r$-quotient map, to one between $r$-coloured permutations pairs of $r$-ribbon built on a fixed $r$-core (the Stanton-White correspondence). Viewing as N}^r$ non-zero being unit vectors), this also generalised arbitrary $r$-core; generalisation is derived from correspondence, again map. Shimozono White recently defined more interesting tableaux; unlike it respects spin statistic tableaux, relating directly colours permutation. We define construction establishing bijective general $r$-core, which those similar manner, matrix entries. asymmetric case are taken $\{0,1\}^r$. More surprising than existence such fact that these Knuth correspondences not Schensted means standardisation. That method does work for since $r\geq3$, no insertion preserve standardisations horizontal strips. Instead, we use analysis Fomin focus at level single entry pair ribbon strips, call shape datum. datum non-trivial idea underlying Shimozono-White takes form an algorithm traversing edge sequences shapes involved. As result particular way traversal has set up, our neither nor correspondence: specialises transpose former, variation latter called Burge correspondence. In terms generating series, proves commutation relation operators add remove strips; equivalent certain acting $q$-deformed Fock space, obtained Kashiwara, Miwa Stern. It implies identity $$\sum_{\lambda\geq_r(0)}G^{(r)}_\lambda(q^{1\over2},X) G^{(r)}_\lambda(q^{1\over2},Y) =\prod_{i,j\in{\bf N}}\prod_{k=0}^{r-1}{1\over1-q^kX_iY_j}; $$ where $G^{(r)}_\lambda(q^{1\over2},X)\in{\bf Z}[q^{1\over2}][[X]]$ series $q^{{\rm spin}(P)}X^{{\rm wt}(P)}$ $P$ $\lambda$; $q$-analogue $r$-fold Cauchy identity, factors into product $r$ Schur functions $q^{1\over2}=1$. Our similarly \check N}}\prod_{k=0}^{r-1}(1+q^kX_iY_j). $\check G^{(r)}_\lambda(q^{1\over2},X)$ spin}^{\rm t}(P)}X^{{\rm $P$, ${\rm t}(P)$ denotes standardisation appropriate tableaux.

参考文章(25)
Sergey Fomin, Duality of Graded Graphs Journal of Algebraic Combinatorics. ,vol. 3, pp. 357- 404 ,(1994) , 10.1023/A:1022412010826
Marc Van Leeuwen, The Robinson-Schensted and Schutzenberger algorithms, an elementary approach Electronic Journal of Combinatorics. ,vol. 3, pp. 15- ,(1995) , 10.37236/1273
Shalosh B. Ekhad, Doron Zeilberger, The Number of Solutions of $X^2=0$ in Triangular Matrices Over $GF(q)$ Electronic Journal of Combinatorics. ,vol. 3, pp. 2- ,(1995) , 10.37236/1226
Richard P. Stanley, Enumerative Combinatorics: Volume 1 ,(1997)
Christophe Carré, Bernard Leclerc, Splitting the Square of a Schur Function into its Symmetric and Antisymmetric Parts Journal of Algebraic Combinatorics. ,vol. 4, pp. 201- 231 ,(1995) , 10.1023/A:1022475927626
Sergey Fomin, Schensted Algorithms for Dual Graded Graphs Journal of Algebraic Combinatorics. ,vol. 4, pp. 5- 45 ,(1995) , 10.1023/A:1022404807578
S. V. Fomin, Generalized Robinson-Schensted-Knuth correspondence Journal of Mathematical Sciences. ,vol. 41, pp. 979- 991 ,(1988) , 10.1007/BF01247093
Dennis W Stanton, Dennis E White, A schensted algorithm for rim hook tableaux Journal of Combinatorial Theory, Series A. ,vol. 40, pp. 211- 247 ,(1985) , 10.1016/0097-3165(85)90088-3
Sergey Fomin, Schur operators and Knuth correspondences Journal of Combinatorial Theory, Series A. ,vol. 72, pp. 277- 292 ,(1995) , 10.1016/0097-3165(95)90065-9
C. Schensted, Longest Increasing and Decreasing Subsequences Canadian Journal of Mathematics. ,vol. 13, pp. 299- 311 ,(1961) , 10.1007/978-0-8176-4842-8_21