Search arXivSearch

arXiv · 2412.02932

Schubert polynomials and patterns in permutations

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{é}sz{á}ros--St. Dizier--Tanjaya. Some problems and conjectures are discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter L. Guo, Zhuowei Lin. 2024-12-04. Schubert polynomials and patterns in permutations. https://arxiv.org/abs/2412.02932

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO