Maximum of the characteristic polynomial of random unitary matrices

From MaRDI portal
Publication:507178

DOI10.1007/S00220-016-2740-6zbMATH Open1371.15036arXiv1511.07399OpenAlexW3104709962MaRDI QIDQ507178FDOQ507178


Authors: Louis-Pierre Arguin, David Belius, P. Bourgade Edit this on Wikidata


Publication date: 3 February 2017

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: It was recently conjectured by Fyodorov, Hiary and Keating that the maximum of the characteristic polynomial on the unit circle of a NimesN random unitary matrix sampled from the Haar measure grows like CN/(logN)3/4 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 [N1varepsilon,N1+varepsilon], for arbitrarily small varepsilon. 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.


Full work available at URL: https://arxiv.org/abs/1511.07399




Recommendations




Cites Work


Cited In (71)





This page was built for publication: Maximum of the characteristic polynomial of random unitary matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507178)