University of Sydney
School of Mathematics and Statistics
Multiplication of Schubert Polynomials.
Friday 1st March, 12-1pm,
Schubert polynomials may be seen as a generalisation of
Schur polynomials. So one of the open problems is the
finding of a rule for the multiplication, which is
solved in the case of the Schur polynomials by the
famous Littlewood Richardson Rule.
I will give an algorithm for multiplying a Schubert
polynomial and a Schur polynomial. The proof uses an
combinatorial description of the Schubert polynomials.