Riemann–Hilbert problems have applications to several related classes of problems. ;A.
Integrable models: The
inverse scattering or inverse spectral problem associated to the
Cauchy problems for 1+1 dimensional
partial differential equations on the line, or to periodic problems, or even to initial-boundary value problems (), can be stated as a Riemann–Hilbert problem. Likewise the inverse
monodromy problem for
Painlevé equations can be stated as a Riemann–Hilbert problem. ;B.
Orthogonal polynomials,
Random matrices: Given a weight on a contour, the corresponding orthogonal polynomials can be computed via the solution of a Riemann–Hilbert factorization problem (). Furthermore, the distribution of eigenvalues of random matrices in several classical ensembles is reduced to computations involving orthogonal polynomials (see e.g. ). ;C. Combinatorial
probability: The most celebrated example is the theorem of on the distribution of the length of the longest increasing subsequence of a random permutation. Together with the study of
B above, it is one of the original rigorous investigations of so-called "integrable probability". But the connection between the theory of integrability and various classical ensembles of random matrices goes back to the work of Dyson (see e.g. ). ;D. Connection to
Donaldson-Thomas theory: The work of Bridgeland studies a class of Riemann-Hilbert problems coming from Donaldson-Thomas theory and makes connections with Gromov-Witten theory and exact
WKB. The numerical analysis of Riemann–Hilbert problems can provide an effective way for numerically solving integrable
PDEs (see e.g. ).
Use for asymptotics In particular, Riemann–Hilbert factorization problems are used to extract asymptotic values for the three problems above (say, as time goes to infinity, or as the dispersion coefficient goes to zero, or as the polynomial degree goes to infinity, or as the size of the permutation goes to infinity). There exists a method for extracting the asymptotic behavior of solutions of Riemann–Hilbert problems, analogous to the
method of stationary phase and the
method of steepest descent applicable to exponential integrals. By analogy with the classical asymptotic methods, one "deforms" Riemann–Hilbert problems which are not explicitly solvable to problems that are. The so-called "nonlinear" method of stationary phase is due to , expanding on a previous idea by and and using technical background results from and . A crucial ingredient of the Deift–Zhou analysis is the asymptotic analysis of singular integrals on contours. The relevant kernel is the standard
Cauchy kernel (see ; also cf. the scalar example below). An essential extension of the nonlinear method of stationary phase has been the introduction of the so-called finite gap g-function transformation by , which has been crucial in most applications. This was inspired by work of Lax, Levermore and Venakides, who reduced the analysis of the small dispersion limit of the
KdV equation to the analysis of a maximization problem for a logarithmic potential under some external field: a variational problem of "electrostatic" type (see ). The g-function is the logarithmic transform of the maximizing "equilibrium" measure. The analysis of the small dispersion limit of
KdV equation has in fact provided the basis for the analysis of most of the work concerning "real" orthogonal polynomials (i.e. with the orthogonality condition defined on the real line) and Hermitian random matrices. Perhaps the most sophisticated extension of the theory so far is the one applied to the "non self-adjoint" case, i.e. when the underlying Lax operator (the first component of the
Lax pair) is not
self-adjoint, by . In that case, actual "steepest descent contours" are defined and computed. The corresponding variational problem is a max-min problem: one looks for a contour that minimizes the "equilibrium" measure. The study of the variational problem and the proof of existence of a regular solution, under some conditions on the external field, was done in ; the contour arising is an "S-curve", as defined and studied in the 1980s by Herbert R. Stahl, Andrei A. Gonchar and Evguenii A Rakhmanov. An alternative asymptotic analysis of Riemann–Hilbert factorization problems is provided in , especially convenient when jump matrices do not have analytic extensions. Their method is based on the analysis of d-bar problems, rather than the asymptotic analysis of singular integrals on contours. An alternative way of dealing with jump matrices with no analytic extensions was introduced in . Another extension of the theory appears in where the underlying space of the Riemann–Hilbert problem is a compact hyperelliptic
Riemann surface. The correct factorization problem is no more holomorphic, but rather
meromorphic, by reason of the
Riemann–Roch theorem. The related singular kernel is not the usual Cauchy kernel, but rather a more general kernel involving meromorphic differentials defined naturally on the surface (see e.g. the appendix in ). The Riemann–Hilbert problem deformation theory is applied to the problem of stability of the infinite periodic
Toda lattice under a "short range" perturbation (for example a perturbation of a finite number of particles). Most Riemann–Hilbert factorization problems studied in the literature are 2-dimensional, i.e., the unknown matrices are of dimension 2. Higher-dimensional problems have been studied by
Arno Kuijlaars and collaborators, see e.g. . == See also ==