arXiv:2412.02932 [math.CO]AbstractReferencesReviewsResources
Schubert polynomials and patterns in permutations
Published 2024-12-04Version 1
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.
Comments: 23 pages
Related articles: Most relevant | Search more
arXiv:math/9905109 [math.CO] (Published 1999-05-19)
Universal Counting of Lattice Points in Polytopes
arXiv:1206.4827 [math.CO] (Published 2012-06-21)
A classification of smooth convex 3-polytopes with at most 16 lattice points
arXiv:1506.02331 [math.CO] (Published 2015-06-08)
On the span of lattice points in a parallelepiped