Bumping algorithm for set-valued shifted tableaux

Bumping algorithm for set-valued shifted tableaux

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

Full description

Bibliographic Details
Main Authors: Takeshi Ikeda, Hiroshi Naruse, Yasuhide Numata
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2011-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
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]
Online Access:https://dmtcs.episciences.org/2931/pdf

Internet

https://dmtcs.episciences.org/2931/pdf

Similar Items