Upper Bounds of Schubert Polynomials
Neil J.Y. Fan, Peter L. Guo

TL;DR
This paper characterizes when Schubert and key polynomials reach their upper bounds based on permutation and composition pattern avoidance, revealing new combinatorial and algebraic properties.
Contribution
It provides a complete pattern avoidance characterization for the upper bounds of Schubert and key polynomials, linking combinatorics with algebraic geometry.
Findings
Schubert polynomial reaches upper bound iff permutation avoids patterns 1432 and 1423.
Key polynomial reaches upper bound iff composition avoids pattern (0,2).
When avoiding (0,2), key polynomials are Lorentzian, supporting a conjecture.
Abstract
Let be a permutation of , and let be the Rothe diagram of . The Schubert polynomial can be realized as the dual character of the flagged Weyl module associated to . This implies a coefficient-wise inequality \[\mathrm{Min}_w(x)\leq \mathfrak{S}_w(x)\leq \mathrm{Max}_w(x),\] where both and are polynomials determined by . Fink, M\'esz\'aros and St.Dizier found that equals the lower bound if and only if avoids twelve permutation patterns. In this paper, we show that reaches the upper bound if and only if avoids two permutation patterns 1432 and 1423. Similarly, for any given composition , one can define a lower bound and an upper bound…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
