Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Bumping algorithm fo ...
Conference paper

Bumping algorithm for set-valued shifted tableaux

Takeshi Ikeda (1), Hiroshi Naruse (2), Yasuhide Numata (3) (4)
(1) Okayama University of Science
(2) Okayama University
(3) Department of Mathematical Informatics
(4) Japan Science and Technology Agency
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2010
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Proceedings
DOI
10.46298/dmtcs.2931
License
https://about.hal.science/hal-authorisation-v1
Indicators
650
Views
699
Downloads

Bumping algorithm for set-valued shifted tableaux

Takeshi Ikeda (1), Hiroshi Naruse (2), Yasuhide Numata (3) (4)
(1) Okayama University of Science
(2) Okayama University
(3) Department of Mathematical Informatics
(4) Japan Science and Technology Agency
Abstract
English
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.
French
Nous présentons un algorithme d'insertion de Robinson–Schensted qui s'applique aux tableaux décalés à valeurs sur des ensembles. Notre algorithme est une généralisation de l'algorithme de Buch pour les tableaux à valeurs sur des ensembles et de l'algorithme de Worley et Sagan pour les tableaux décalés. Comme application, nous obtenons une formule de Pieri pour un analogue en K-théorie des Q-functions de Schur.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • set-valued shifted tableaux
  • insertion
  • Robinson―Schensted
  • Pieri rule
  • K-theory
  • Schur Q-functions
Cited by

Source: OpenCitations

  • K -theoretic analogues of factorial Schur P - and Q -functions

    Advances in Mathematics

    Authors : Takeshi Ikeda ORCID, Hiroshi Naruse ORCID

    Journal reference : Volume 243, 2013, pp. 22-66

    DOI : 10.1016/j.aim.2013.04.014
  • Neutral-fermionic presentation of the K-theoretic Q-function

    arXiv (Cornell University)

    Authors : Shinsuke Iwao ORCID

    Journal reference : Volume 55, 2021, pp. 629-662

    DOI : 10.1007/s10801-021-01064-4
  • Genomic tableaux

    arXiv (Cornell University)

    Authors : Oliver Pechenik ORCID, Alexander Yong ORCID

    Journal reference : Volume 45, 2016, pp. 649-685

    DOI : 10.1007/s10801-016-0720-8
Preview
Loading PDF preview...