Bumping algorithm for set-valued shifted tableaux

Takeshi Ikeda*, Hiroshi Naruse, Yasuhide Numata

*この研究の対応する著者

研究成果: Paper査読

3 被引用数 (Scopus)

抄録

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.

本文言語English
ページ527-538
ページ数12
出版ステータスPublished - 2011
外部発表はい
イベント23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11 - Reykjavik, Iceland
継続期間: 2011 6 132011 6 17

Conference

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

ASJC Scopus subject areas

  • 代数と数論

フィンガープリント

「Bumping algorithm for set-valued shifted tableaux」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル