Abstract
Mitosis is a rule introduced by Knutson and Miller for manipulating subsets of the n× n grid. It provides an algorithm that lists the reduced pipe dreams (also known as rc-graphs) of Fomin and Kirillov for a permutation w∈ S n by downward induction on weak Bruhat order, thereby generating the coefficients of Schubert polynomials of Lascoux and Schützenberger inductively. This note provides a short and purely combinatorial proof of these properties of mitosis.
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.
