On the proof of universality for orthogonal and symplectic ensembles in random matrix theory
Abstract
We give a streamlined proof of a quantitative version of a result from [DG1] which is crucial for the proof of universality in the bulk [DG1] and also at the edge [DG2] for orthogonal and symplectic ensembles of random matrices. As a byproduct, this result gives asymptotic information on a certain ratio of the beta=1,2,4 partition functions for log gases.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.