An insertion algorithm for multiplying Demazure characters by Schur polynomials

2021/09/12 by Sami Assaf, Assaf, Sami H. · 1 citation
Mathematics · #Advanced Algebra and Geometry #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algebraic Geometry (math.AG) #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Representation Theory (math.RT)

paper · pdf · doi:10.48550/arxiv.2109.05651

openalex publication_date 2021/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• A Local Characterization of Unions of Demazure Crystals

Related

• A Pieri rule for Demazure characters of the general linear group
• Semistandard Tableaux for Demazure Characters (Key Polynomials) and Their Atoms
• Polynomial bases: positivity and Schur multiplication
• Kohnert's rule for flagged Schur modules
• A generalization of Edelman--Greene insertion for Schubert polynomials