2000 character limit reached
An insertion algorithm for multiplying Demazure characters by Schur polynomials
Published 13 Sep 2021 in math.CO, math.AG, and math.RT | (2109.05651v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.