Multi-critical unitary random matrix ensembles and the general Painlevé II equation (Q2389122): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q485298 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Yueh-er Kuo / rank
Normal rank
 
Property / author
 
Property / author: Arno B. J. Kuijlaars / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Yueh-er Kuo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155511356 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math-ph/0508062 / rank
 
Normal rank

Latest revision as of 05:16, 19 April 2024

scientific article
Language Label Description Also known as
English
Multi-critical unitary random matrix ensembles and the general Painlevé II equation
scientific article

    Statements

    Multi-critical unitary random matrix ensembles and the general Painlevé II equation (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2009
    0 references
    The authors study unitary random matrix ensembles. In order to compute the double scaling limits of the eigenvalue correlation kernel near the origin, they use the \textit{P. Deift} and \textit{X. Zhou} [Ann. Math. (2) 137, No. 2, 295--368 (1993; Zbl 0771.35042)] steepest descent method applied to the Riemann-Hilbert (RH) problem for orthogonal polynomials on the real line. The paper is divided into the sections: Introduction and statement of results; The RH problem for Painlevé II and proof of Theorem 1.1; Steepest analysis of the RH problem; Proof of Theorm 1.2 and Proof of Theorem 1.7.
    0 references
    unitary Random matrix
    0 references
    steepest descent method
    0 references
    orthogonal polynomials
    0 references
    Riemann-Hilbert problem
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references