Mitosis recursion for coefficients of Schubert polynomials
Ezra Miller
Abstract
Mitosis is a rule introduced by [Knutson-Miller, 2002] for manipulating subsets of the n by n grid. It provides an algorithm that lists the reduced pipe dreams (also known as rc-graphs) [Fomin-Kirillov, Bergeron-Billey] for a permutation w in Sn by downward induction on weak Bruhat order, thereby generating the coefficients of Schubert polynomials [Lascoux-Schutzenberger] inductively. This note provides a short and purely combinatorial proof of these properties of mitosis.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.