Geometric mitosis
classification
🧮 math.AG
math.RT
keywords
algorithmflaggeometricmitosispolytopescoincidescombinatorialcombinatorics
read the original abstract
We describe an elementary convex geometric algorithm for realizing Schubert cycles in complete flag varieties by unions of faces of polytopes. For GL_n and Gelfand--Zetlin polytopes, combinatorics of this algorithm coincides with that of the mitosis on pipe dreams introduced by Knutson and Miller. For Sp_4 and a Newton--Okounkov polytope of the symplectic flag variety, the algorithm yields a new combinatorial rule that extends to Sp_{2n}.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.