Mitosis recursion for coefficients of Schubert polynomials
From MaRDI portal
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 S_n 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.
Recommendations
Cites work
- A combinatorial construction of the Schubert polynomials
- A unified approach to combinatorial formulas for Schubert polynomials
- Diagram rules for the generation of Schubert polynomials
- scientific article; zbMATH DE number 3779503 (Why is no real title available?)
- scientific article; zbMATH DE number 17784 (Why is no real title available?)
- scientific article; zbMATH DE number 14020 (Why is no real title available?)
- RC-Graphs and Schubert Polynomials
- Schubert polynomials and the nilCoxeter algebra
- Some combinatorial properties of Schubert polynomials
- Subword complexes in Coxeter groups.
- The Yang-Baxter equation, symmetric functions, and Schubert polynomials
Cited in
(9)- Mitosis algorithm for Grothendieck polynomials
- Factorizations in Schubert cells
- Schubert calculus from polyhedral parametrizations of Demazure crystals
- On the relationship between pipe dreams and permutation words
- Gröbner geometry of Schubert polynomials through ice
- Combinatorics of semi-toric degenerations of Schubert varieties in type C
- Simple geometric mitosis
- Geometric mitosis
- Crystal chute moves on pipe dreams
This page was built for publication: Mitosis recursion for coefficients of Schubert polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406736)