Computation and sampling for Schubert specializations
Proceedings of the National Academy of Sciences · 03.11.2026 · 123 (44)
DOI: 10.1073/pnas.2615757123 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the National Academy of Sciences, online erschienen am 29.10.2026. Verfasst von David Anderson und 2 weiteren Autor:innen. Beteiligte Einrichtung: Department of Mathematics, Ohio State University, Columbus, OH 43210. Die Arbeit nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: National Science Foundation (NSF), Simons Foundation (SF), Institute for Advanced Study (IAS).
Abstract (Originalsprache)
We study a problem at the interface of enumerative algebraic geometry, algebraic combinatorics, and the statistical mechanics of vertex models with long-range interactions. We develop methods to explore the values S w ( 1 , … , 1 ) of Schubert polynomials (called principal specializations), which count reduced bumpless pipe dreams (RBPDs) with boundary permutation w ∈ S n . We exhibit counterexamples to the conjecture of Merzon and Smirnov that S w ( 1 n ) is maximized on layered permutations; the smallest such example we find is at n = 17. Despite the counterexamples, we present bounds that support a refined conjecture that the maximum of S w ( 1 n ) over all w ∈ S n grows at the same asymptotic rate as the maximum over layered permutations (found by Morales, Pak, and Panova). We implement and benchmark four recurrences for Schubert specializations: the descent formula of Macdonald, the transition formula of Lascoux–Schützenberger, the cotransition formula of Knutson, and the formula of Billey, Jockusch, and Stanley. We also explore typical random permutations drawn with probability proportional to S w ( 1 n ) , equivalently from uniformly random RBPDs. Our simulations reveal a permuton-like limit analogous to the Grothendieck setting studied by Morales, Panova, Petrov, and Yeliussizov. For sampling, we show that the standard monotone Coupling From The Past framework does not apply to RBPDs, leaving exact uniform sampling open. To bypass this, we develop an efficient Markov chain Monte Carlo sampler augmented with macroscopic “droop” updates that preserve connectivity and accelerate mixing. Our publicly available fast implementations reach n = 20 for exact computation of S w ( 1 n ) and n = 100 for Markov chain Monte Carlo sampling using a chain whose stationary distribution is uniform on RBPDs (run on a cluster).
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Department of Mathematics, Ohio State University, Columbus, OH 43210.
- Department of Mathematics, University of Southern California, Los Angeles, CA 90089.
- Department of Mathematics, University of Virginia, Charlottesville, VA 22904.
ORCID-Profile: David Anderson, Greta Panova, Leonid Petrov
Förderung
- National Science Foundation (NSF)
- Simons Foundation (SF)
- Institute for Advanced Study (IAS)
Zitieren
APA
Anderson, D., Panova, G., & Petrov, L. (2026). Computation and sampling for Schubert specializations. Proceedings of the National Academy of Sciences, 123(44). https://doi.org/10.1073/pnas.2615757123
Vancouver
Anderson D, Panova G, Petrov L. Computation and sampling for Schubert specializations. Proceedings of the National Academy of Sciences. 2026;123(44). doi:10.1073/pnas.2615757123
BibTeX
@article{Anderson2026,
author = {Anderson, David and Panova, Greta and Petrov, Leonid},
title = {Computation and sampling for Schubert specializations},
journal = {Proceedings of the National Academy of Sciences},
year = {2026},
volume = {123},
number = {44},
doi = {10.1073/pnas.2615757123}
}
EUVIMED