Single-SEM Schubert Polynomials
Combinatorics
2025-03-11 v2
Abstract
We give a pattern-avoidance characterization of such that the Schubert polynomial 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.
Cite
@article{arxiv.2503.03903,
title = {Single-SEM Schubert Polynomials},
author = {Dora Woodruff},
journal= {arXiv preprint arXiv:2503.03903},
year = {2025}
}
Comments
11 pages, 5 figures