New Titles  |  FAQ  |  Keep Informed  |  Review Cart  |  Contact Us Quick Search (Advanced Search ) Browse by Subject General Interest Logic & Foundations Number Theory Algebra & Algebraic Geometry Discrete Math & Combinatorics Analysis Differential Equations Geometry & Topology Probability & Statistics Applications Mathematical Physics Math Education
Return to List

Skew-Orthogonal Polynomials and Random Matrix Theory
Saugata Ghosh, Gurgaon, India
A co-publication of the AMS and Centre de Recherches Mathématiques.
 SEARCH THIS BOOK:
CRM Monograph Series
2009; 127 pp; hardcover
Volume: 28
ISBN-10: 0-8218-4878-X
ISBN-13: 978-0-8218-4878-4
List Price: US$51 Member Price: US$40.80
Order Code: CRMM/28

See also:

Orthogonal Polynomials and Random Matrices: A Riemann-Hilbert Approach - Percy Deift

Random Matrix Theory: Invariant Ensembles and Universality - Percy Deift and Dimitri Gioev

WIN--Women in Numbers: Research Directions in Number Theory - Alina-Carmen Cojocaru, Kristin Lauter, Rachel Pries and Renate Scheidler

Orthogonal polynomials satisfy a three-term recursion relation irrespective of the weight function with respect to which they are defined. This gives a simple formula for the kernel function, known in the literature as the Christoffel-Darboux sum. The availability of asymptotic results of orthogonal polynomials and the simple structure of the Christoffel-Darboux sum make the study of unitary ensembles of random matrices relatively straightforward.

In this book, the author develops the theory of skew-orthogonal polynomials and obtains recursion relations which, unlike orthogonal polynomials, depend on weight functions. After deriving reduced expressions, called the generalized Christoffel-Darboux formulas (GCD), he obtains universal correlation functions and non-universal level densities for a wide class of random matrix ensembles using the GCD.

The author also shows that once questions about higher order effects are considered (questions that are relevant in different branches of physics and mathematics) the use of the GCD promises to be efficient.

Titles in this series are co-published with the Centre de Recherches Mathématiques.

Readership

Research mathematicians interested in random matrix theory.

 AMS Home | Comments: webmaster@ams.org © Copyright 2014, American Mathematical Society Privacy Statement