Search arXivSearch

arXiv · 2604.02964

The record statistic and forward stability of Schubert products

Abstract

We initiate a probabilistic study of forward stability for products of Schubert polynomials through the record statistic (left-to-right maxima) of permutations. Building on the explicit record formula for forward stability obtained by Hardt and Wallach, we study random pairs of permutations drawn from three natural families: uniform permutations, Grassmannian permutations, and Boolean permutations. For each family, we determine record probabilities and use them to analyze the asymptotic behavior of forward stability. For uniform and Grassmannian permutations, we obtain asymptotics for the mean together with limiting distribution results. For Boolean permutations, we prove linear-order growth of the mean, and our analysis also produces an explicit time-inhomogeneous Markov chain that yields an exact linear-time uniform sampler. Beyond these cases, we prove that the record-set statistic is equidistributed on the avoidance classes of $132$ and $231$, and consequently the corresponding forward stability distributions coincide. We conclude with conjectures for numerous further permutation classes and a conjectural recursive criterion for when two avoidance classes have the same record-set distribution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Hardt, Reuven Hodges, Hanzhang Yin. 2026-04-03. The record statistic and forward stability of Schubert products. https://arxiv.org/abs/2604.02964

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