Scholarlink

<p>Revisiting Kraśkiewicz and Pragacz’s construction of <i>Schubert modules</i>, we provide a new proof that their characters are equal to Schubert polynomials. The main innovation is a representation-theoretic interpretation of a recurrence relation for Schubert polynomials recently discovered by Nadeau, Spink, and Tewari. Along the way, we review several related constructions, and show that the Nadeau-Spink-Tewari recursion determines the characters of flagged Schur modules coming from the broader classes of <i>transparent</i> and <i>translucent</i> diagrams. We conclude with a conjecture concerning the Schubert positivity of the characters of transparent diagrams.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Filtrations and recursions for Schubert modules

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年8月3日

查看全文
  • David Anderson

摘要

Revisiting Kraśkiewicz and Pragacz’s construction of Schubert modules, we provide a new proof that their characters are equal to Schubert polynomials. The main innovation is a representation-theoretic interpretation of a recurrence relation for Schubert polynomials recently discovered by Nadeau, Spink, and Tewari. Along the way, we review several related constructions, and show that the Nadeau-Spink-Tewari recursion determines the characters of flagged Schur modules coming from the broader classes of transparent and translucent diagrams. We conclude with a conjecture concerning the Schubert positivity of the characters of transparent diagrams.