2020
DOI: 10.1016/j.jcta.2020.105216
|View full text |Cite
|
Sign up to set email alerts
|

A symplectic refinement of shifted Hecke insertion

Abstract: Buch, Kresch, Shimozono, Tamvakis, and Yong defined Hecke insertion to formulate a combinatorial rule for the expansion of the stable Grothendieck polynomials G π indexed by permutations in the basis of stable Grothendieck polynomials G λ indexed by partitions. Patrias and Pylyavskyy introduced a shifted analogue of Hecke insertion whose natural domain is the set of maximal chains in a weak order on orbit closures of the orthogonal group acting on the complete flag variety. We construct a generalization of shi… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
31
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(32 citation statements)
references
References 30 publications
1
31
0
Order By: Relevance
“…The latter, in turn, is a special case of the shifted Hecke insertion algorithm from [14,33]. As explained in Remark 2.3, the correspondence a → (P O EG (a), Q O EG (a)) is the "orthogonal" counterpart to a "symplectic" shifted insertion algorithm studied in [16,28,29].…”
Section: Outlinementioning
confidence: 97%
See 3 more Smart Citations
“…The latter, in turn, is a special case of the shifted Hecke insertion algorithm from [14,33]. As explained in Remark 2.3, the correspondence a → (P O EG (a), Q O EG (a)) is the "orthogonal" counterpart to a "symplectic" shifted insertion algorithm studied in [16,28,29].…”
Section: Outlinementioning
confidence: 97%
“…Here, a semistandard shifted tableau is allowed to have primed entries in diagonal positions; for the precise definition, see Section 2. Restricting a → (P O EG (a), Q O EG (a)) to unprimed words gives the map called involution Coxeter-Knuth insertion in [12,28] and orthogonal Edelman-Greene insertion in [29]. The latter, in turn, is a special case of the shifted Hecke insertion algorithm from [14,33].…”
Section: Outlinementioning
confidence: 99%
See 2 more Smart Citations
“…Let InvHecke(z) denote the set of involution Hecke words for an element z in I n or I FPF n . This set was denoted as either H O (z) for z ∈ I n or H Sp (z) for z ∈ I FPF n in [12]. Also define (z) = min{ (a) : a ∈ InvHecke(z)}.…”
Section: Involution Grothendieck Polynomialsmentioning
confidence: 99%