Single-SEM Schubert Polynomials
Abstract
We give a pattern-avoidance characterization of w ∈ Sn such that the Schubert polynomial Sw is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We solve a similar problem for complete homogeneous monomials.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.