Search arXivSearch

arXiv · 2001.09145

The geometric Burge correspondence and the partition function of polymer replicas

Abstract

We construct a geometric lifting of the Burge correspondence as a composition of local birational maps on generic Young-diagram-shaped arrays. We establish its fundamental relation to the geometric Robinson-Schensted-Knuth correspondence and to the geometric Sch\"utzenberger involution. We also show a number of properties of the geometric Burge correspondence, specializing them to the case of symmetric input arrays. In particular, our construction shows that such a mapping is volume preserving in log-log variables. As an application, we consider a model of two polymer paths of given length constrained to have the same endpoint, known as polymer replica. We prove that the distribution of the polymer replica partition function in a log-gamma random environment is a Whittaker measure, and deduce the corresponding Whittaker integral identity. For a certain choice of the parameters, we notice a distributional identity between our model and the symmetric log-gamma polymer studied by O'Connell, Sepp\"al\"ainen, and Zygouras (2014).

Explore related subjects

Keep this discovery

BibTeXRIS

Elia Bisi, Neil O'Connell, Nikos Zygouras. 2020-01-24. The geometric Burge correspondence and the partition function of polymer replicas. https://doi.org/10.1007/s00029-021-00712-8

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR