Softcover ISBN: | 978-0-8218-2695-9 |
Product Code: | CLN/3 |
List Price: | $40.00 |
MAA Member Price: | $36.00 |
AMS Member Price: | $32.00 |
eBook ISBN: | 978-1-4704-3107-5 |
Product Code: | CLN/3.E |
List Price: | $37.00 |
MAA Member Price: | $33.30 |
AMS Member Price: | $29.60 |
Softcover ISBN: | 978-0-8218-2695-9 |
eBook: ISBN: | 978-1-4704-3107-5 |
Product Code: | CLN/3.B |
List Price: | $77.00 $58.50 |
MAA Member Price: | $69.30 $52.65 |
AMS Member Price: | $61.60 $46.80 |
Softcover ISBN: | 978-0-8218-2695-9 |
Product Code: | CLN/3 |
List Price: | $40.00 |
MAA Member Price: | $36.00 |
AMS Member Price: | $32.00 |
eBook ISBN: | 978-1-4704-3107-5 |
Product Code: | CLN/3.E |
List Price: | $37.00 |
MAA Member Price: | $33.30 |
AMS Member Price: | $29.60 |
Softcover ISBN: | 978-0-8218-2695-9 |
eBook ISBN: | 978-1-4704-3107-5 |
Product Code: | CLN/3.B |
List Price: | $77.00 $58.50 |
MAA Member Price: | $69.30 $52.65 |
AMS Member Price: | $61.60 $46.80 |
-
Book DetailsCourant Lecture NotesVolume: 3; 2000; 261 ppMSC: Primary 30; 33; 60; 15; 26
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random \(n {\times} n\) matrices exhibit universal behavior as \(n {\rightarrow} {\infty}\)? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
Titles in this series are co-published with the Courant Institute of Mathematical Sciences at New York University.
ReadershipGraduate students and research mathematicians interested in functions of a complex variable.
-
Table of Contents
-
Chapters
-
Chapter 1. Riemann-Hilbert problems
-
Chapter 2. Jacobi operators
-
Chapter 3. Orthogonal polynomials
-
Chapter 4. Continued fractions
-
Chapter 5. Random matrix theory
-
Chapter 6. Equilibrium measures
-
Chapter 7. Asymptotics for orthogonal polynomials
-
Chapter 8. Universality
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random \(n {\times} n\) matrices exhibit universal behavior as \(n {\rightarrow} {\infty}\)? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
Titles in this series are co-published with the Courant Institute of Mathematical Sciences at New York University.
Graduate students and research mathematicians interested in functions of a complex variable.
-
Chapters
-
Chapter 1. Riemann-Hilbert problems
-
Chapter 2. Jacobi operators
-
Chapter 3. Orthogonal polynomials
-
Chapter 4. Continued fractions
-
Chapter 5. Random matrix theory
-
Chapter 6. Equilibrium measures
-
Chapter 7. Asymptotics for orthogonal polynomials
-
Chapter 8. Universality