• 제목/요약/키워드: generalized Young tableaux

검색결과 4건 처리시간 0.015초

Generating function of cells of generalized young tableaux

  • Park, Seul-Hee;Lee, Jae-Jin
    • 대한수학회지
    • /
    • 제32권4호
    • /
    • pp.713-724
    • /
    • 1995
  • In 1954 Frame, Robinson and Thrall [5] gave the hook formula for the number of standard Young tableaux of a given shape. Since then many proofs for the hook formula have been given using various methods. See [9] forprobabilistic method and see [6] or [12] for combinatorial ones. Regev [10] has given asymptotic values for these numbers and Gouyou-Beauchamps [8] gave exact formulas for the number of standard Young tableaux having n cells and at most k rows in the cases k = 4 and k = 5.

  • PDF

PRAFFIAN AND YOUNG TABLEAUX

  • Choi, Seul-Hee
    • 대한수학회논문집
    • /
    • 제12권3호
    • /
    • pp.789-796
    • /
    • 1997
  • We consider a Pfaffian and its combinatorial model. We give a bijection between Pfaffian and the generating function of weights of generalized Young tableaux by this combinatorial model, and we find an explicit formula for the Pfaffian by this bijection.

  • PDF

A BUMPING ALGORITHM ON THE SHIFTED RIM HOOK TABLEAUX

  • Lee, Jae-Jin
    • Journal of applied mathematics & informatics
    • /
    • 제6권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.

SHIFTED TABLEAU SWITCHINGS AND SHIFTED LITTLEWOOD-RICHARDSON COEFFICIENTS

  • Choi, Seung-Il;Nam, Sun-Young;Oh, Young-Tak
    • 대한수학회지
    • /
    • 제56권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.