Maximum of the Characteristic Polynomial of Random Unitary Matrices

By L. Arguin, David Belius, P. Bourgade. Communications in Mathematical Physics, 2015

127 citations recorded by the source corpus.

It was recently conjectured by Fyodorov, Hiary and Keating that the maximum of the characteristic polynomial on the unit circle of a N×N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${N\times N}$$\end{document} random unitary matrix sampled from the Haar measure grows like CN/(logN)3/4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${CN/({\rm log} N)^{3/4}}$$\end{document} for some random variable C. In this paper, we verify the leading order of this conjecture, that is, we prove that with high probability the maximum lies in the range [N1-ε,N1+ε]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${[N^{1 - \varepsilon},N^{1 + \varepsilon}]}$$\end{document}, for arbitrarily small ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon}$$\end{document}. The method is based on identifying an approximate branching random walk in the Fourier decomposition of the characteristic polynomial, and uses techniques developed to describe the extremes of branching random walks and of other log-correlated random fields. A key technical input is the asymptotic analysis of Toeplitz determinants with dimension-dependent symbols. The original argument for these asymptotics followed the general idea that the statistical mechanics of 1/f-noise random energy models is governed by a freezing transition. We also prove the conjectured freezing of the free energy for random unitary matrices.

Subfields: Geometry and Topology, Mathematical Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/50fdfff26e39d66108f32bf2d08bba9a642c3fcc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

  1. Joseph Najnudel
  2. L. Arguin
  3. David Belius
  4. P. Bourgade
  5. Maksym Radziwill
  6. Elliot Paquette
  7. Ofer Zeitouni
  8. Kannan Soundararajan

In Mathematical Physics

  1. Joseph Najnudel
  2. L. Arguin
  3. David Belius
  4. P. Bourgade
  5. Elliot Paquette
  6. Eero Saksman
  7. Christian Webb
  8. Maksym Radziwill

In Statistics and Probability

  1. Joseph Najnudel
  2. Elliot Paquette
  3. L. Arguin
  4. Ofer Zeitouni
  5. David Belius
  6. P. Bourgade
  7. Kannan Soundararajan
  8. Christian Webb

Citations in the corpus