![]() |
Discrete Mathematics & Theoretical Computer Science |
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.
Source : ScholeXplorer
IsRelatedTo ARXIV math/0004137 Source : ScholeXplorer IsRelatedTo DOI 10.1007/bf02392644 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0004137
|