Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
Abstract
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric -matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main innovation in our work is establishing sharp estimates regarding the rank distribution of symmetric random -matrices over for primes . Previously, such estimates were available only for . At the heart of our proof is a way to combine multiple inverse Littlewood--Offord-type results to control the contribution to singularity-type events of vectors in with anticoncentration at least . Previously, inverse Littlewood--Offord-type results only allowed control over vectors with anticoncentration at least for some large constant .
Keywords
Cite
@article{arxiv.2106.04049,
title = {Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial},
author = {Asaf Ferber and Vishesh Jain and Ashwin Sah and Mehtaab Sawhney},
journal= {arXiv preprint arXiv:2106.04049},
year = {2021}
}
Comments
12 pages; comments welcome!