Takeshi Ikeda ; Hiroshi Naruse ; Yasuhide Numata - Bumping algorithm for set-valued shifted tableaux

dmtcs:2931 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2931
Bumping algorithm for set-valued shifted tableaux

Authors: Takeshi Ikeda 1; Hiroshi Naruse 2; Yasuhide Numata 3,4

  • 1 Okayama University of Science
  • 2 Okayama University
  • 3 Department of Mathematical Informatics
  • 4 Japan Science and Technology Agency

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.

https://doi.org/10.46298/dmtcs.2931
Source: HAL:hal-01215052v1
Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Section: Proceedings
Published on: January 1, 2011
Imported on: January 31, 2017
Keywords: set-valued shifted tableaux,insertion,Robinson―Schensted,Pieri rule,K-theory,Schur Q-functions,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV math/0004137
Source : ScholeXplorer IsRelatedTo DOI 10.1007/bf02392644
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0004137
  • 10.1007/bf02392644
  • 10.48550/arxiv.math/0004137
  • math/0004137
A Littlewood-Richardson rule for the K-theory of Grassmannians

3 Documents citing this article

Share and export

Consultation statistics

This page has been seen 192 times.
This article's PDF has been downloaded 255 times.