Maximum of the characteristic polynomial for a random permutation matrix

From MaRDI portal



Abstract: Let PN be a uniform random NimesN permutation matrix and let chiN(z)=det(zIN−PN) denote its characteristic polynomial. We prove a law of large numbers for the maximum modulus of chiN on the unit circle, specifically, [ sup_{|z|=1}|chi_N(z)|= N^{x_0 + o(1)} ] with probability tending to one as Noinfty, for a numerical constant x0approx0.652. The main idea of the proof is to uncover a logarithmic correlation structure for the distribution of (the logarithm of) chiN, viewed as a random field on the circle, and to adapt a well-known second moment argument for the maximum of the branching random walk. Unlike the well-studied emph{CUE field} in which PN is replaced with a Haar unitary, the distribution of chiN(e2piit) is sensitive to Diophantine properties of the point t. To deal with this we borrow tools from the Hardy--Littlewood circle method in analytic number theory.












This page was built for publication: Maximum of the characteristic polynomial for a random permutation matrix

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