2000 character limit reached
Multiplication of a Schubert polynomial by a Stanley symmetric polynomial
Published 1 Feb 2017 in math.CO and math.AG | (1702.00132v1)
Abstract: We prove, combinatorially, that the product of a Schubert polynomial by a Stanley symmetric polynomial is a truncated Schubert polynomial. Using Monk's rule, we derive a nonnegative combinatorial formula for the Schubert polynomial expansion of a truncated Schubert polynomial. Combining these results, we give a nonnegative combinatorial rule for the product of a Schubert and a Schur polynomial in the Schubert basis.
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.