Bumping algorithm for set-valued shifted tableaux

Takeshi Ikeda; Hiroshi Naruse; Yasuhide Numata

Bumping algorithm for set-valued shifted tableaux

Takeshi Ikeda, Hiroshi Naruse, Yasuhide Numata

Research output: Contribution to conference › Paper › peer-review

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 language	English
Pages	527-538
Number of pages	12
Publication status	Published - 2011
Externally published	Yes
Event	23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11 - Reykjavik, Iceland Duration: 2011 Jun 13 → 2011 Jun 17

Conference

Conference	23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11
Country/Territory	Iceland
City	Reykjavik
Period	11/6/13 → 11/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

Cite this

@conference{591890dad0c5469691f145fd7cca3dc3,

title = "Bumping algorithm for set-valued shifted tableaux",

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.",

keywords = "Insertion, K-theory, Pieri rule, Robinson-Schensted, Schur Q-functions, Set-valued shifted tableaux",

author = "Takeshi Ikeda and Hiroshi Naruse and Yasuhide Numata",

year = "2011",

language = "English",

pages = "527--538",

note = "23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11 ; Conference date: 13-06-2011 Through 17-06-2011",

}

TY - CONF

T1 - Bumping algorithm for set-valued shifted tableaux

AU - Ikeda, Takeshi

AU - Naruse, Hiroshi

AU - Numata, Yasuhide

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Insertion

KW - K-theory

KW - Pieri rule

KW - Robinson-Schensted

KW - Schur Q-functions

KW - Set-valued shifted tableaux

UR - http://www.scopus.com/inward/record.url?scp=84860434501&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860434501&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84860434501

SP - 527

EP - 538

T2 - 23rd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'11

Y2 - 13 June 2011 through 17 June 2011

ER -

Bumping algorithm for set-valued shifted tableaux

Abstract

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this