Bumping algorithm for set-valued shifted tableaux
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2011_special_260_a44,
     author = {Ikeda, Takeshi and Naruse, Hiroshi and Numata, Yasuhide},
     title = {Bumping algorithm for set-valued shifted tableaux},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)},
     year = {2011},
     doi = {10.46298/dmtcs.2931},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2931/}
}
TY  - JOUR
AU  - Ikeda, Takeshi
AU  - Naruse, Hiroshi
AU  - Numata, Yasuhide
TI  - Bumping algorithm for set-valued shifted tableaux
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2931/
DO  - 10.46298/dmtcs.2931
LA  - en
ID  - DMTCS_2011_special_260_a44
ER  - 
%0 Journal Article
%A Ikeda, Takeshi
%A Naruse, Hiroshi
%A Numata, Yasuhide
%T Bumping algorithm for set-valued shifted tableaux
%J Discrete mathematics & theoretical computer science
%D 2011
%V DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2931/
%R 10.46298/dmtcs.2931
%G en
%F DMTCS_2011_special_260_a44
Ikeda, Takeshi; Naruse, Hiroshi; Numata, Yasuhide. Bumping algorithm for set-valued shifted tableaux. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011). doi : 10.46298/dmtcs.2931. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2931/

Cité par Sources :