加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本