Physical Sciences and Mathematics Commons^™

Schubert Polynomial Multiplication, Sara Amato

Honors Theses

Schur polynomials are a fundamental object in the field of algebraic combinatorics. The product of two Schur polynomials can be written as a sum of Schur polynomials using non-negative integer coefficients. A simple combinatorial algorithm for generating these coefficients is called the Littlewood-Richardson Rule. Schubert polynomials are generalizations of the Schur polynomials. Schubert polynomials also appear in many contexts, such as in algebraic combinatorics and algebraic geometry. It is known from algebraic geometry that the product of two Schubert polynomials can be written as a sum of Schubert polynomials using non-negative integer coefficients. However, a simple combinatorial algorithm for generating …