Search arXivSearch

arXiv · 1401.2419

The normal matrix model with a monomial potential, a vector equilibrium problem, and multiple orthogonal polynomials on a star

Abstract

We investigate the asymptotic behavior of a family of multiple orthogonal polynomials that is naturally linked with the normal matrix model with a monomial potential of arbitrary degree $d+1$. The polynomials that we investigate are multiple orthogonal with respect to a system of $d$ analytic weights defined on a symmetric $(d+1)$-star centered at the origin. In the first part we analyze in detail a vector equilibrium problem involving a system of $d$ interacting measures $(μ_{1},\ldots,μ_{d})$ supported on star-like sets in the plane. We show that in the subcritical regime, the first component $μ_{1}^{*}$ of the solution to this problem is the asymptotic zero distribution of the multiple orthogonal polynomials. It also characterizes the domain where the eigenvalues in the normal matrix model accumulate, in the sense that the Schwarz function associated with the boundary of this domain can be expressed explicitly in terms of $μ_{1}^{*}$. The second part of the paper is devoted to the asymptotic analysis of the multiple orthogonal polynomials. The asymptotic results are obtained again in the subcritical regime, and they follow from the Deift/Zhou steepest descent analysis of a Riemann-Hilbert problem of size $(d+1)\times (d+1)$. The vector equilibrium problem and the Riemann-Hilbert problem that we investigate are generalizations of those studied recently by Bleher-Kuijlaars in the case $d=2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arno B. J. Kuijlaars, Abey López-García. 2015-01-16. The normal matrix model with a monomial potential, a vector equilibrium problem, and multiple orthogonal polynomials on a star. https://doi.org/10.1088/0951-7715%2F28%2F2%2F347

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

KEEP EXPLORING

Related papers

Fragment-wise differentiable structures

The $p$-modulus of curves, test plans, upper gradients, charts, differentials, approximations in energy and density of directions are all concepts associated to the theory of Sobolev functions in metric measure spaces. The purpose of this paper is to give an analogous geometric and ``fragment-wise'' theory for Lipschitz functions and Weaver derivations, where $\infty$-modulus of curve fragments, $\ast$-upper gradients and Alberti representations play a central role. We give a new definition of fragment-wise charts and prove that they exists for spaces with finite Hausdorff dimension. We give a replacement for $p$-duality in terms of Alberti representations and $\infty$-modulus and present the theory of $\ast$-upper gradients. Further, we give new and sharper results for approximations of Lipschitz functions, which yields the density of directions. Our results are applicable to all complete and separable metric measure spaces. In the process, we show that there are strong parallels between the Sobolev and Lipschitz worlds.

math.CA

Tensor Derivatives, Unified Tensor-Form Differential Equations, and Model Reduction via Partial Tucker Decomposition

This paper develops a unified tensor calculus for matrix-valued functions and their derivatives, and leverages this framework to construct efficient model reduction techniques for high-dimensional tensor differential equations. We first establish a systematic theory of tensor differentiation, wherein the derivative of a matrix with respect to another matrix is represented as a fourth-order tensor. Building on this calculus, we recast linear ordinary differential equations (ODEs) and partial differential equations(PDEs) into a compact tensor-matrix form $\frac{dX}{dt} = \A\ast X$. The general solution is expressed as $X = \exp(t\A)\ast C$, extending the matrix exponential to the tensor setting. Conditions under which the solution admits this exponential form are characterized in terms of the commutativity of the associated matrix slices. We introduce the partial Tucker decomposition (parTuckerD) to address the computational challenges posed by high-order tensor systems. On a synthetic electronic health record (EHR) tensor, parTuckerD achieves a relative reconstruction error of $0.0992$ with a $136.3\times$ compression ratio, matching the accuracy of the full TuckerD while preserving patient-level similarity structure. The results demonstrate that the proposed tensor calculus and parTuckerD framework provide a principle and computationally efficient approach for analyzing and solving high-dimensional tensor differential equations arising in data-intensive applications.

math.CA

Distance preservers for Lobachevsky space

We obtain a complete description of the class of entrywise preservers of Lorentz-Gram matrices. This resolves, for the case of constant negative curvature, the classification of entrywise preservers obtained by Schoenberg in the zero-curvature (Euclidean) and constant-positive-curvature (spherical) settings. These preservers admit a Lévy--Khintchine-type representation and their asymptotic characteristics are related to Krein's classification of screw lines in Lobachevsky space. Connections with complete Nevanlinna--Pick kernels and Bochner subordination are also obtained.

math.CA