<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="4.2.2">Jekyll</generator><link href="https://lpetrov.cc/posts/feed.xml" rel="self" type="application/atom+xml" /><link href="https://lpetrov.cc/" rel="alternate" type="text/html" /><updated>2026-04-11T09:07:01-04:00</updated><id>https://lpetrov.cc/posts/feed.xml</id><title type="html">Leonid Petrov</title><subtitle>Leonid Petrov. Integrable Probability</subtitle><author><name>Leonid Petrov</name></author><entry><title type="html">Computation and sampling for Schubert specializations</title><link href="https://lpetrov.cc/2026/03/schubert-computation-sampling/" rel="alternate" type="text/html" title="Computation and sampling for Schubert specializations" /><published>2026-03-20T00:00:00-04:00</published><updated>2026-03-20T00:00:00-04:00</updated><id>https://lpetrov.cc/2026/03/schubert-computation-sampling</id><content type="html" xml:base="https://lpetrov.cc/2026/03/schubert-computation-sampling/"><![CDATA[<p>We present computational results related to principal specializations of the Schubert polynomials $\mathfrak{S}_w(1^n)$ for permutations $w\in S_n$. Equivalently, these specializations count reduced pipe dreams (and reduced bumpless pipe dreams - RBPD) with boundary conditions determined by $w$. We find the first counterexample, at $n=17$, to the conjecture of Merzon-Smirnov that the maximal value of $\mathfrak{S}_w(1^n)$ is obtained at a layered permutation. We explore the typical permutation obtained from uniformly random RBPDs, revealing a permuton-like asymptotic behavior similar to the one derived for Grothendieck polynomials.</p>

<p>We implement and compare three recurrence relations for computing $\mathfrak{S}_w(1^n)$: the descent formula of Macdonald, the transition formula of Lascoux-Schützenberger, and the cotransition formula of Knutson. We prove that the global constraint of reducedness breaks the sublattice property of the underlying alternating sign matrix (ASM) lattice, preventing standard monotone Coupling From The Past (CFTP). To bypass this, we develop a highly efficient MCMC sampler augmented with macroscopic “droop” updates to guarantee state space connectivity and accelerate mixing. Our implementations enable computation of $\mathfrak{S}_w(1^n)$ up to $n\sim 20$ on a personal computer, and uniform sampling of reduced bumpless pipe dreams up to $n\sim 100$ on a cluster.</p>]]></content><author><name>Leonid Petrov</name></author><category term="blog" /><category term="math" /><category term="preprint" /><summary type="html"><![CDATA[We present computational results related to principal specializations of the Schubert polynomials $\mathfrak{S}_w(1^n)$ for permutations $w\in S_n$. Equivalently, these specializations count reduced pipe dreams (and reduced bumpless pipe dreams - RBPD) with boundary conditions determined by $w$. We find the first counterexample, at $n=17$, to the conjecture of Merzon-Smirnov that the maximal value of $\mathfrak{S}_w(1^n)$ is obtained at a layered permutation. We explore the typical permutation obtained from uniformly random RBPDs, revealing a permuton-like asymptotic behavior similar to the one derived for Grothendieck polynomials. We implement and compare three recurrence relations for computing $\mathfrak{S}_w(1^n)$: the descent formula of Macdonald, the transition formula of Lascoux-Schützenberger, and the cotransition formula of Knutson. We prove that the global constraint of reducedness breaks the sublattice property of the underlying alternating sign matrix (ASM) lattice, preventing standard monotone Coupling From The Past (CFTP). To bypass this, we develop a highly efficient MCMC sampler augmented with macroscopic “droop” updates to guarantee state space connectivity and accelerate mixing. Our implementations enable computation of $\mathfrak{S}_w(1^n)$ up to $n\sim 20$ on a personal computer, and uniform sampling of reduced bumpless pipe dreams up to $n\sim 100$ on a cluster.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://lpetrov.cc/__STORAGE_URL__/img/papers/bpd_sample_n100.png" /><media:content medium="image" url="https://lpetrov.cc/__STORAGE_URL__/img/papers/bpd_sample_n100.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Integrable Probability arXiv Feed</title><link href="https://lpetrov.cc/2026/03/arxiv-feed/" rel="alternate" type="text/html" title="Integrable Probability arXiv Feed" /><published>2026-03-09T00:00:00-04:00</published><updated>2026-03-09T00:00:00-04:00</updated><id>https://lpetrov.cc/2026/03/arxiv-feed</id><content type="html" xml:base="https://lpetrov.cc/2026/03/arxiv-feed/"><![CDATA[<div><a href="https://lpetrov.cc/arxiv/">Integrable Probability arXiv Feed</a> — a curated, searchable archive of arXiv papers in integrable probability, from the 1990s to the present, with related paper cross-references.</div>]]></content><author><name>Leonid Petrov</name></author><category term="quick_link" /><summary type="html"><![CDATA[Integrable Probability arXiv Feed — a curated, searchable archive of arXiv papers in integrable probability, from the 1990s to the present, with related paper cross-references.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://lpetrov.cc/__STORAGE_URL__/img/blog/arxiv-feed.png" /><media:content medium="image" url="https://lpetrov.cc/__STORAGE_URL__/img/blog/arxiv-feed.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Lozenge Merch</title><link href="https://lpetrov.cc/2026/03/merch/" rel="alternate" type="text/html" title="Lozenge Merch" /><published>2026-03-01T00:00:00-05:00</published><updated>2026-03-01T00:00:00-05:00</updated><id>https://lpetrov.cc/2026/03/merch</id><content type="html" xml:base="https://lpetrov.cc/2026/03/merch/"><![CDATA[<div>Get a lozenge design printed on anything! (<a href="https://www.redbubble.com/people/tilinger/shop?asc=u" target="_blank" rel="noopener">Link to shop</a>)</div>]]></content><author><name>Leonid Petrov</name></author><category term="quick_link" /><summary type="html"><![CDATA[Get a lozenge design printed on anything! (Link to shop)]]></summary></entry><entry><title type="html">Math Experimental Lab Spring 2026</title><link href="https://lpetrov.cc/2026/02/mel-s26/" rel="alternate" type="text/html" title="Math Experimental Lab Spring 2026" /><published>2026-02-05T00:00:00-05:00</published><updated>2026-02-05T00:00:00-05:00</updated><id>https://lpetrov.cc/2026/02/mel-s26</id><content type="html" xml:base="https://lpetrov.cc/2026/02/mel-s26/"><![CDATA[<div><a href="https://lpetrov.cc/mel-s26/">Math Experimental Lab: Random Surfaces and Random Permutations</a> — Spring 2026 project page.</div>]]></content><author><name>Leonid Petrov</name></author><category term="quick_link" /><summary type="html"><![CDATA[Math Experimental Lab: Random Surfaces and Random Permutations — Spring 2026 project page.]]></summary></entry><entry><title type="html">Colored Interlacing Triangles and Genocchi Medians</title><link href="https://lpetrov.cc/2026/02/genocchi/" rel="alternate" type="text/html" title="Colored Interlacing Triangles and Genocchi Medians" /><published>2026-02-04T00:00:00-05:00</published><updated>2026-02-04T00:00:00-05:00</updated><id>https://lpetrov.cc/2026/02/genocchi</id><content type="html" xml:base="https://lpetrov.cc/2026/02/genocchi/"><![CDATA[<p>Colored interlacing triangles, introduced by Aggarwal-Borodin-Wheeler (2024), provide the combinatorial framework for the Central Limit Theorem for probability measures arising from the Lascoux-Leclerc-Thibon (LLT) polynomials. Colored interlacing triangles depend on two key parameters: the number of colors $n$ and the depth of the triangle $N$. Recent work of Gaetz-Gao (2025) connects these objects to Schubert calculus and resolves the enumeration for $n=3$ and arbitrary depth $N$. However, the enumerative behavior for general $n$ has remained open.</p>

<p>In this paper, we analyze the complementary regime: fixed depth $N=2$ and arbitrary number of colors $n$. We prove that in this setting, colored interlacing triangles are in bijection with Dumont derangements, identifying their enumeration with the Genocchi medians. This connects the probabilistic model to a rich hierarchy of classical combinatorial objects.</p>

<p>Furthermore, we introduce a $q$-deformation of this enumeration arising naturally from the LLT transition energy. This yields new $q$-analogs of the Genocchi medians. Finally, we present computational results and sampling algorithms for colored interlacing triangles with higher $N$ or $n$, which suggests the limits of combinatorial tractability in the $(N,n)$ parameter space.</p>]]></content><author><name>Leonid Petrov</name></author><category term="blog" /><category term="math" /><category term="preprint" /><summary type="html"><![CDATA[Colored interlacing triangles, introduced by Aggarwal-Borodin-Wheeler (2024), provide the combinatorial framework for the Central Limit Theorem for probability measures arising from the Lascoux-Leclerc-Thibon (LLT) polynomials. Colored interlacing triangles depend on two key parameters: the number of colors $n$ and the depth of the triangle $N$. Recent work of Gaetz-Gao (2025) connects these objects to Schubert calculus and resolves the enumeration for $n=3$ and arbitrary depth $N$. However, the enumerative behavior for general $n$ has remained open. In this paper, we analyze the complementary regime: fixed depth $N=2$ and arbitrary number of colors $n$. We prove that in this setting, colored interlacing triangles are in bijection with Dumont derangements, identifying their enumeration with the Genocchi medians. This connects the probabilistic model to a rich hierarchy of classical combinatorial objects. Furthermore, we introduce a $q$-deformation of this enumeration arising naturally from the LLT transition energy. This yields new $q$-analogs of the Genocchi medians. Finally, we present computational results and sampling algorithms for colored interlacing triangles with higher $N$ or $n$, which suggests the limits of combinatorial tractability in the $(N,n)$ parameter space.]]></summary></entry><entry><title type="html">EGMT 1520 • Building Truth from Scratch (Empirical &amp;amp; Scientific Engagement)</title><link href="https://lpetrov.cc/2026/01/EGMT/" rel="alternate" type="text/html" title="EGMT 1520 • Building Truth from Scratch (Empirical &amp;amp; Scientific Engagement)" /><published>2026-01-11T00:00:00-05:00</published><updated>2026-01-11T00:00:00-05:00</updated><id>https://lpetrov.cc/2026/01/EGMT</id><content type="html" xml:base="https://lpetrov.cc/2026/01/EGMT/"><![CDATA[]]></content><author><name>Leonid Petrov</name></author><category term="teaching" /><summary type="html"><![CDATA[]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://lpetrov.cc/__STORAGE_URL__/courses/EGMT/EGMT_image.png" /><media:content medium="image" url="https://lpetrov.cc/__STORAGE_URL__/courses/EGMT/EGMT_image.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Blue Ridge Probability Day</title><link href="https://lpetrov.cc/2025/11/BlueRidgeProb/" rel="alternate" type="text/html" title="Blue Ridge Probability Day" /><published>2025-11-17T00:00:00-05:00</published><updated>2025-11-17T00:00:00-05:00</updated><id>https://lpetrov.cc/2025/11/BlueRidgeProb</id><content type="html" xml:base="https://lpetrov.cc/2025/11/BlueRidgeProb/"><![CDATA[<div><a href="https://math.virginia.edu/2026/01/BlueRidgeProb2026/">Blue Ridge Probability Day</a>, <strong>March 13, 2026 at University of Virginia</strong>.</div>]]></content><author><name>Leonid Petrov</name></author><category term="quick_link" /><summary type="html"><![CDATA[Blue Ridge Probability Day, March 13, 2026 at University of Virginia.]]></summary></entry><entry><title type="html">EGMT 1520 • Building Truth from Scratch (Empirical &amp;amp; Scientific Engagement)</title><link href="https://lpetrov.cc/2025/08/EGMT/" rel="alternate" type="text/html" title="EGMT 1520 • Building Truth from Scratch (Empirical &amp;amp; Scientific Engagement)" /><published>2025-08-15T00:00:00-04:00</published><updated>2025-08-15T00:00:00-04:00</updated><id>https://lpetrov.cc/2025/08/EGMT</id><content type="html" xml:base="https://lpetrov.cc/2025/08/EGMT/"><![CDATA[]]></content><author><name>Leonid Petrov</name></author><category term="teaching" /><summary type="html"><![CDATA[]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://lpetrov.cc/__STORAGE_URL__/courses/EGMT/EGMT_image.png" /><media:content medium="image" url="https://lpetrov.cc/__STORAGE_URL__/courses/EGMT/EGMT_image.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Random Lozenge Waterfall: Dimensional Collapse of Gibbs Measures</title><link href="https://lpetrov.cc/2025/07/waterfall/" rel="alternate" type="text/html" title="Random Lozenge Waterfall: Dimensional Collapse of Gibbs Measures" /><published>2025-07-29T00:00:00-04:00</published><updated>2025-07-29T00:00:00-04:00</updated><id>https://lpetrov.cc/2025/07/waterfall</id><content type="html" xml:base="https://lpetrov.cc/2025/07/waterfall/"><![CDATA[<p>We investigate the asymptotic behavior of the $q$-Racah
probability measure on lozenge tilings of a hexagon whose
side lengths scale linearly with a parameter $L\to\infty$,
while the parameters $q\in(0,1)$ and $\kappa\in
\mathbf{i}\mathbb{R}$ remain fixed.
This regime differs fundamentally
from the traditional case $q\sim e^{-c/L}\to1$, in which
random tilings are locally governed by two-dimensional
translation-invariant ergodic Gibbs measures.
In
the fixed-$q$ regime we uncover a new macroscopic phase, the
<em>waterfall</em> (previously only observed experimentally),
where the two-dimensional Gibbs structure collapses into a
one-dimensional random stepped interface that we call a
<em>barcode</em>.</p>

<p>We prove a law of large numbers and
exponential concentration, showing that the random tilings
converge to a deterministic waterfall profile.
We further conjecture an explicit
correlation kernel of the one-dimensional barcode process
arising in the limit.
Remarkably, the limit is invariant under shifts by
$2\mathbb{Z}$ but not by $\mathbb{Z}$, exhibiting an
emergent period-two structure absent from the original
weights.
Our conjectures are supported by extensive numerical
evidence and perfect sampling simulations.
The kernel is built from a family of
functions orthogonal in both spaces
$\ell^{2}(\mathbb{Z})$
and $\ell^{2}(\mathbb{Z}+\frac12)$,
that may be of independent interest.</p>

<p>Our proofs adapt the spectral projection method of
<a href="https://arxiv.org/abs/0905.0679">Borodin–Gorin–Rains (2009)</a> to the regime with fixed $q$.
The resulting asymptotic analysis is substantially more
involved, and leads to non-self-adjoint operators. We
overcome these challenges in the exponential concentration
result by a separate argument based on sharp bounds for the
ratios of probabilities under the $q$-Racah orthogonal polynomial ensemble.</p>]]></content><author><name>Leonid Petrov</name></author><category term="blog" /><category term="math" /><category term="preprint" /><summary type="html"><![CDATA[We investigate the asymptotic behavior of the $q$-Racah probability measure on lozenge tilings of a hexagon whose side lengths scale linearly with a parameter $L\to\infty$, while the parameters $q\in(0,1)$ and $\kappa\in \mathbf{i}\mathbb{R}$ remain fixed. This regime differs fundamentally from the traditional case $q\sim e^{-c/L}\to1$, in which random tilings are locally governed by two-dimensional translation-invariant ergodic Gibbs measures. In the fixed-$q$ regime we uncover a new macroscopic phase, the waterfall (previously only observed experimentally), where the two-dimensional Gibbs structure collapses into a one-dimensional random stepped interface that we call a barcode. We prove a law of large numbers and exponential concentration, showing that the random tilings converge to a deterministic waterfall profile. We further conjecture an explicit correlation kernel of the one-dimensional barcode process arising in the limit. Remarkably, the limit is invariant under shifts by $2\mathbb{Z}$ but not by $\mathbb{Z}$, exhibiting an emergent period-two structure absent from the original weights. Our conjectures are supported by extensive numerical evidence and perfect sampling simulations. The kernel is built from a family of functions orthogonal in both spaces $\ell^{2}(\mathbb{Z})$ and $\ell^{2}(\mathbb{Z}+\frac12)$, that may be of independent interest. Our proofs adapt the spectral projection method of Borodin–Gorin–Rains (2009) to the regime with fixed $q$. The resulting asymptotic analysis is substantially more involved, and leads to non-self-adjoint operators. We overcome these challenges in the exponential concentration result by a separate argument based on sharp bounds for the ratios of probabilities under the $q$-Racah orthogonal polynomial ensemble.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://lpetrov.cc/__STORAGE_URL__/img/papers/waterfall_paper.png" /><media:content medium="image" url="https://lpetrov.cc/__STORAGE_URL__/img/papers/waterfall_paper.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">2026 travel</title><link href="https://lpetrov.cc/2025/07/travel-2026/" rel="alternate" type="text/html" title="2026 travel" /><published>2025-07-25T00:00:00-04:00</published><updated>2025-07-25T00:00:00-04:00</updated><id>https://lpetrov.cc/2025/07/travel-2026</id><content type="html" xml:base="https://lpetrov.cc/2025/07/travel-2026/"><![CDATA[<!--more-->

<h3 id="january">January</h3>

<p>4-7 •
Washington, DC •
<a href="https://jointmathematicsmeetings.org/jmm">Joint Mathematics Meetings</a>, organizing a special session on Random Tilings, Random Permutations, and Particle Systems (January 7)</p>

<p>23 •
Fairfax, VA •
George Mason University, Colloquium</p>

<h3 id="february">February</h3>

<p>19 •
Farmville, VA •
<a href="https://www.longwood.edu/mathematics/colloquium-series/">Longwood University, Colloquium</a></p>

<h3 id="march">March</h3>

<p>13 • Charlottesville, VA • <a href="https://math.virginia.edu/2026/03/BlueRidgeProb/">Blue Ridge Probability Day</a></p>

<p>16-17 • Stanford University, Palo Alto, CA • Probability seminar</p>

<p>18 • UC Berkeley, Berkeley, CA • Probability seminar</p>

<h3 id="april">April</h3>

<p>6 • Vassar College, Poughkeepsie, NY • Colloquium</p>

<p>20-24 •
College Park, MD •
<a href="https://brinmrc.umd.edu/spring26-kpzucrt/">The Kardar-Parisi-Zhang Universality Class &amp; Related Topics</a> workshop at the Brin Mathematics Research Center</p>

<!-- ### May -->

<h3 id="june">June</h3>

<p>1-5 •
Edinburgh, UK •
<a href="https://icms.ac.uk/activities/workshop/universality-in-the-kpz-and-rmt/">Universality in the KPZ and RMT</a> workshop at ICMS</p>

<h3 id="july">July</h3>

<p>5-18 •
Stony Brook, NY •
<a href="https://scgp.stonybrook.edu/archives/45985">4th Simons Math Summer Workshop: Algebraic methods in probability</a> at the Simons Center for Geometry and Physics</p>

<p>27-31 •
Djursholm, Sweden •
<a href="https://www.mittag-leffler.se/activities/solvable-lattice-models-representation-theory-of-quantum-groups-and-algebraic-combinatorics/">Solvable lattice models, representation theory of quantum groups and algebraic combinatorics</a> at Institut Mittag-Leffler</p>

<!-- ### August -->

<h3 id="september">September</h3>

<p>14-Oct 10 •
Vienna, Austria •
<a href="https://www.esi.ac.at/events/t1171/">Statistical Mechanics and Combinatorics of Discrete Planar Structures</a> thematic programme at the Erwin Schrödinger Institute</p>

<!-- ### October -->

<!-- ### November -->

<!-- ### December -->]]></content><author><name>Leonid Petrov</name></author><category term="travel" /><category term="travel-plans" /><category term="blog" /><summary type="html"><![CDATA[]]></summary></entry></feed>