Sums of Schubert structure constants with bounded Coxeter length
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_ | 1866909650210783232 |
|---|---|
| author | Stelzer, Ada |
| author_facet | Stelzer, Ada |
| contents | Pak-Robichaux recently introduced a signed puzzle rule for Schubert structure constants, which they use to show that sums $γ_k(n)$ of these constants with a bounded number of inversions are polynomial. We give a different, conceptual proof of their theorem. Our argument computes the lead term of $γ_k(n)$ and extends to all classical Lie types. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13684 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sums of Schubert structure constants with bounded Coxeter length Stelzer, Ada Combinatorics Representation Theory Pak-Robichaux recently introduced a signed puzzle rule for Schubert structure constants, which they use to show that sums $γ_k(n)$ of these constants with a bounded number of inversions are polynomial. We give a different, conceptual proof of their theorem. Our argument computes the lead term of $γ_k(n)$ and extends to all classical Lie types. |
| title | Sums of Schubert structure constants with bounded Coxeter length |
| topic | Combinatorics Representation Theory |
| url | https://arxiv.org/abs/2506.13684 |