Mitosis recursion for coefficients of Schubert polynomials

Simple item page
dc.creatorMiller, Ezra
dc.date2002-12-10
dc.date.accessioned2026-07-07T04:53:39Z
dc.date.available2026-07-07T04:53:39Z
dc.descriptionMitosis 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.
dc.description9 pages, to appear in JCTA
dc.identifierhttps://arxiv.org/abs/math/0212131
dc.identifierhttp://arxiv.org/abs/math/0212131
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65937
dc.subjectCombinatorics
dc.titleMitosis recursion for coefficients of Schubert polynomials
dc.typetext

Files

Collections

arXiv