A row analogue of Hecke column insertion

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Huang, Daoji, Shimozono, Mark, Yu, Tianyi
Natura: Preprint
Pubblicazione: 2022
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916263032258560
author Huang, Daoji
Shimozono, Mark
Yu, Tianyi
author_facet Huang, Daoji
Shimozono, Mark
Yu, Tianyi
contents We introduce a new row insertion algorithm on decreasing tableaux and increasing tableaux, generalizing Edelman-Greene (EG) row insertion. Our row insertion algorithm is a nontrivial variation of Hecke column insertion which generalizes EG column insertion. Similar to Hecke column insertion, our row insertion is bijective and respects Hecke equivalence, and therefore recovers the expansions of stable Grothendieck functions into Grassmannian stable Grothendieck functions.
format Preprint
id arxiv_https___arxiv_org_abs_2211_02993
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle A row analogue of Hecke column insertion
Huang, Daoji
Shimozono, Mark
Yu, Tianyi
Combinatorics
05E05
We introduce a new row insertion algorithm on decreasing tableaux and increasing tableaux, generalizing Edelman-Greene (EG) row insertion. Our row insertion algorithm is a nontrivial variation of Hecke column insertion which generalizes EG column insertion. Similar to Hecke column insertion, our row insertion is bijective and respects Hecke equivalence, and therefore recovers the expansions of stable Grothendieck functions into Grassmannian stable Grothendieck functions.
title A row analogue of Hecke column insertion
topic Combinatorics
05E05
url https://arxiv.org/abs/2211.02993