Bumping algorithm for set-valued shifted tableaux

Takeshi Ikeda, Hiroshi Naruse, Yasuhide Numata

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

We present an insertion algorithm of Robinson-Schensted type that applies to set-valued shifted Young tableaux. Our algorithm is a generalization of both set-valued non-shifted tableaux by Buch and non set-valued shifted tableaux by Worley and Sagan. As an application, we obtain a Pieri rule for a K-theoretic analogue of the Schur Q-functions.

Original languageEnglish
Pages527-538
Number of pages12
Publication statusPublished - 2011
Externally publishedYes
Event23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11 - Reykjavik, Iceland
Duration: 2011 Jun 132011 Jun 17

Conference

Conference23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11
CountryIceland
CityReykjavik
Period11/6/1311/6/17

Keywords

  • Insertion
  • K-theory
  • Pieri rule
  • Robinson-Schensted
  • Schur Q-functions
  • Set-valued shifted tableaux

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint Dive into the research topics of 'Bumping algorithm for set-valued shifted tableaux'. Together they form a unique fingerprint.

  • Cite this

    Ikeda, T., Naruse, H., & Numata, Y. (2011). Bumping algorithm for set-valued shifted tableaux. 527-538. Paper presented at 23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11, Reykjavik, Iceland.