A symplectic refinement of shifted Hecke insertion
Eric Marberg

TL;DR
This paper introduces a symplectic refinement of shifted Hecke insertion, providing a combinatorial rule for expanding certain K-theoretic Schur P-functions related to symplectic groups.
Contribution
It generalizes shifted Hecke insertion to symplectic groups and establishes a combinatorial rule for related K-theoretic Schur P-functions.
Findings
Developed a symplectic analogue of shifted Hecke insertion.
Derived a combinatorial expansion rule for symplectic K-theoretic Schur P-functions.
Connected combinatorial insertion algorithms with orbit closures of symplectic groups.
Abstract
Buch, Kresch, Shimozono, Tamvakis, and Yong defined Hecke insertion to formulate a combinatorial rule for the expansion of the stable Grothendieck polynomials indexed by permutations in the basis of stable Grothendieck polynomials 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 shifted Hecke insertion for maximal chains in an analogous weak order on orbit closures of the symplectic group. As an application, we identify a combinatorial rule for the expansion of "orthogonal" and "symplectic" shifted analogues of in Ikeda and Naruse's basis of -theoretic Schur -functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
