Single-SEM Schubert Polynomials

2025/03/05 by Woodruff, Dora
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2503.03903

Abstract

We give a pattern-avoidance characterization of w ∈ S_n such that the Schubert polynomial \mathfrakS_w 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.

Related

• Zero-one Schubert polynomials
• Schubert Polynomials and Elementary Symmetric Products
• Determinantal Formulas for SEM Expansions of Schubert Polynomials
• Zero-one Schubert polynomials
• Schubert polynomials, 132-patterns, and Stanley's conjecture