Metraipolis › archive › dc_6a0f45bb9bbb

Lower and upper bounds of Schur characters — arXiv:2609.02050

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02050
License (as archived)
CC0-1.0
Archived
2026-10-17T05:33:00.676Z
SHA-256 of the archived text
cc1161f849afddb4d76d4b10db4e633de6dccbd865ae02e09669380aa5bcfa5b
Stable URL of this page
https://metraipolis.com/documento/dc_6a0f45bb9bbb

How to cite

Lower and upper bounds of Schur characters — arXiv:2609.02050 — arXiv (en), https://arxiv.org/abs/2609.02050 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6a0f45bb9bbb (Metraipolis archive dc_6a0f45bb9bbb, sha256 cc1161f849afddb4d76d4b10db4e633de6dccbd865ae02e09669380aa5bcfa5b)
BibTeX
@misc{dc6a0f45bb9bbb,
  title = {Lower and upper bounds of Schur characters — arXiv:2609.02050},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02050},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6a0f45bb9bbb; sha256 cc1161f849afddb4d76d4b10db4e633de6dccbd865ae02e09669380aa5bcfa5b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02050. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Characterizations of lower and upper bounds for dual characters of flagged Weyl modules have attracted considerable interest. In this paper, we establish explicit pattern avoidance characterizations for lower and upper bounds of Schur characters, namely, the dual characters of Weyl modules associated with arbitrary diagrams. This setting extends the corresponding extremal problems for dual characters of flagged Weyl modules and includes skew Schur polynomials and, through Rothe diagrams, Stanley symmetric functions. Specifically, for a permutation $w$, we show that the Stanley symmetric function $F_w$ attains the lower bound if and only if $w$ avoids $321,2143,2413,3142$, and $3412$, and attains the upper bound if and only if $w$ avoids $312$ and $321$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.02050 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T04:59:51.771Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).