Abstract
Using a formula of Billey, lockusch and Stanley, Fomin and Kirillov have introduced a new set of diagrams that encode the Schubert polynomials. We call theseobjects rc-graphs. We define and prove two variants of an algorithm for constructing the set of all rc-graphs for a given permutation. This construction makes many of the identities known for Schubert polynomials more apparent, and yields new ones. In particular, we give a new proof of Monk's rule using an insertion algorithm on rc-graphs. We conjecture two analogs of Pieri's rule for multiplying Schubert polynomials. We also extend the algorithm to generate the double Schubert polynomials.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
