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 ∈ Snby 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. © 2003 Published by Elsevier Inc.
Miller, E. (2003). Mitosis recursion for coefficients of Schubert polynomials. Journal of Combinatorial Theory. Series A, 103(2), 223–235. https://doi.org/10.1016/S0097-3165(03)00020-7