Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-01215052
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, October 13, 2015 - 3:05:44 PM
Last modification on : Monday, May 17, 2021 - 12:00:04 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 11:55:27 PM

File

dmAO0147.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01215052, version 1

Collections

Citation

Takeshi Ikeda, Hiroshi Naruse, Yasuhide Numata. Bumping algorithm for set-valued shifted tableaux. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.527-538. ⟨hal-01215052⟩

Share

Metrics

Record views

98

Files downloads

910