Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1106.6168

Orthogonal polynomials in the normal matrix model with a cubic potential

Pavel M. Bleher·Arno B. J. Kuijlaars
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the normal matrix model with a cubic potential. The model is ill-defined, and in order to reguralize it, Elbau and Felder introduced a model with a cut-off and corresponding system of orthogonal polynomials with respect to a varying exponential weight on the cut-off region on the complex plane. In the present paper we show how to define orthogonal polynomials on a specially chosen system of infinite contours on the complex plane, without any cut-off, which satisfy the same recurrence algebraic identity that is asymptotically valid for the orthogonal polynomials of Elbau and Felder. The main goal of this paper is to develop the Riemann-Hilbert (RH) approach to the orthogonal polynomials under consideration and to obtain their asymptotic behavior on the complex plane as the degree $n$ of the polynomial goes to infinity. As the first step in the RH approach, we introduce an auxiliary vector equilibrium problem for a pair of measures $(μ_1,μ_2)$ on the complex plane. We then formulate a $3\times 3$ matrix valued RH problem for the orthogonal polynomials in hand, and we apply the nonlinear steepest descent method of Deift-Zhou to the asymptotic analysis of the RH problem. The central steps in our study are a sequence of transformations of the RH problem, based on the equilibrium vector measure $(μ_1,μ_2)$, and the construction of a global parametrix. The main result of this paper is a derivation of the large $n$ asymptotics of the orthogonal polynomials on the whole complex plane. We prove that the distribution of zeros of the orthogonal polynomials converges to the measure $μ_1$, the first component of the equilibrium measure. We also obtain analytical results for the measure $μ_1$ relating it to the distribution of eigenvalues in the normal matrix model which is uniform in a domain bounded by a simple closed curve.

Explore related subjects

math-phmath.CAmath.MP

Keep this discovery

BibTeXRIS

Pavel M. Bleher, Arno B. J. Kuijlaars. 2011-06-30. Orthogonal polynomials in the normal matrix model with a cubic potential. https://arxiv.org/abs/1106.6168

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

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗