Single-SEM Schubert Polynomials
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915189401583616 |
|---|---|
| author | Woodruff, Dora |
| author_facet | Woodruff, Dora |
| contents | We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_03903 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Single-SEM Schubert Polynomials Woodruff, Dora Combinatorics We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_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. |
| title | Single-SEM Schubert Polynomials |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.03903 |