Schubert polynomials and patterns in permutations

Abstract

This paper investigates the number of supports of the Schubert polynomial Sw(x) indexed by a permutation w. This number also equals the number of lattice points in the Newton polytope of Sw(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\'esz\'aros--St. Dizier--Tanjaya. Some problems and conjectures are discussed.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…