An insertion algorithm for multiplying Demazure characters by Schur polynomials

Abstract

We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of a Demazure character and a Schur polynomial as a sum of Schubert characters, partially resolving Polo's conjecture that the tensor product of Demazure modules admits a Schubert filtration.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…