DOAJ Open Access 2011

Bumping algorithm for set-valued shifted tableaux

Takeshi Ikeda Hiroshi Naruse Yasuhide Numata

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (3)

Takeshi Ikeda

Hiroshi Naruse

Yasuhide Numata

Format Sitasi

APA MLA BibTeX

Ikeda, T., Naruse, H., Numata, Y. (2011). Bumping algorithm for set-valued shifted tableaux. https://doi.org/10.46298/dmtcs.2931

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2931

Informasi Jurnal

Tahun Terbit: 2011
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2931
Akses: Open Access ✓