ProbXiv
Explorersign in
Problem archiveProblem record

Statement

There has been considerable progress (Kuijlaars,...) in understanding basic statistics such as the correlation functions for the 2-matrix random matrix model, and also matrix models with a source. The key element in these developments has been the successful extension by Kuijlaars et al of the Riemann-Hilbert/steepest descent method to 3×33\times3 Riemann-Hilbert problems. So far only the simplest situations have been considered. In order to consider the generic situation, one must, in particular, extend the Riemann-Hilbert/steepest descent method to n×nn\times n Riemann-Hilbert problems. This is a challenging problem which would have important implications, not only for random matrix models, but also for problems in other areas, such as Pad'e-Hermite approximations and irrationality questions for distinguished real numbers, and multi-orthogonal polynomials.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.