Journal article · 2026 · Open access

Computation and sampling for Schubert specializations

David Anderson, Greta Panova, Leonid Petrov

Proceedings of the National Academy of Sciences, 123(44), e2615757123 · Published 29 October 2026 · DOI 10.1073/pnas.2615757123

Open full textCite this paper

In brief

“Computation and sampling for Schubert specializations” is a 2026 journal article by David Anderson and 2 co-authors, published in Proceedings of the National Academy of Sciences. OpenAlex counts 7 citations as of 17 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Proceedings of the National Academy of Sciences.

Citations
7
Most cited in
2026 (6)
Field-weighted impact
11.25
References
46
Authors
3

Abstract

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).

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Anderson, D., Panova, G., & Petrov, L. (2026). Computation and sampling for Schubert specializations. Proceedings of the National Academy of Sciences, 123(44), e2615757123. https://doi.org/10.1073/pnas.2615757123

MLA 9

Anderson, David, et al. “Computation and sampling for Schubert specializations.” Proceedings of the National Academy of Sciences, vol. 123, no. 44, 2026, p. e2615757123. https://doi.org/10.1073/pnas.2615757123.

Chicago

Anderson, David, Greta Panova, and Leonid Petrov. 2026. “Computation and sampling for Schubert specializations.” Proceedings of the National Academy of Sciences 123 (44): e2615757123. https://doi.org/10.1073/pnas.2615757123.

Harvard

Anderson, D., Panova, G. and Petrov, L. (2026) ‘Computation and sampling for Schubert specializations’, Proceedings of the National Academy of Sciences, 123(44), p. e2615757123. doi:10.1073/pnas.2615757123.

IEEE

D. Anderson, G. Panova, and L. Petrov, “Computation and sampling for Schubert specializations,” Proceedings of the National Academy of Sciences, vol. 123, no. 44, p. e2615757123, 2026, doi: 10.1073/pnas.2615757123.

BibTeX

@article{anderson2026computation,
  title     = {{Computation and sampling for Schubert specializations}},
  author    = {Anderson, David and Panova, Greta and Petrov, Leonid},
  journal   = {Proceedings of the National Academy of Sciences},
  year      = {2026},
  volume    = {123},
  number    = {44},
  pages     = {e2615757123},
  doi       = {10.1073/pnas.2615757123},
  url       = {https://doi.org/10.1073/pnas.2615757123}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics

  • Schubert polynomials
  • principal specialization
  • random permutations
  • Markov chain Monte Carlo
  • coupling from the past
  • vertex model
  • long-range interactions
  • enumerative geometry

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Anderson, D., Panova, G., & Petrov, L. (2026). Computation and sampling for Schubert specializations. Proceedings of the National Academy of Sciences, 123(44), e2615757123. https://doi.org/10.1073/pnas.2615757123

How many times has this paper been cited?

7 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Proceedings of the National Academy of Sciences: sign in and open the full text from this page.

Who wrote this paper?

David Anderson, Greta Panova, Leonid Petrov.

What is the DOI of this paper?

10.1073/pnas.2615757123, permanently at https://doi.org/10.1073/pnas.2615757123. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.