Recursive and Combinatorial Properties of Schubert Polynomials


We describe two recursive methods for the calculation of Schubert polynomials and use them to give new relatively simple proofs of their basic properties. Moreover, we present (1) methods for the calculation of a reduced word for a permutation from its Lehmer code (and other small algorithms for the manipulation of Lehmer codes), (2) new determinantal… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics