Papers
Topics
Authors
Recent
Search
2000 character limit reached

Schubert polynomials and patterns in permutations

Published 4 Dec 2024 in math.CO, math.AG, and math.RT | (2412.02932v1)

Abstract: This paper investigates the number of supports of the Schubert polynomial $\mathfrak{S}_w(x)$ indexed by a permutation $w$. This number also equals the number of lattice points in the Newton polytope of $\mathfrak{S}_w(x)$. We establish a lower bound for this number in terms of the occurrences of patterns in $w$. The analysis is carried out in the general framework of dual characters of flagged Weyl modules. Our result considerably improves the bounds for principal specializations of Schubert polynomials or dual flagged Weyl characters previously obtained by Weigandt, Gao, and M{\'e}sz{\'a}ros--St. Dizier--Tanjaya. Some problems and conjectures are discussed.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.