Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T02:32:26.024Z Has data issue: false hasContentIssue false

Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial

Published online by Cambridge University Press:  12 May 2022

ASAF FERBER
Affiliation:
340 Rowland Hall (Building 400), University of California, Irvine, Irvine CA 92697, U.S.A. e-mail: asaff@uci.edu
VISHESH JAIN
Affiliation:
390 Jane Stanford Way, Stanford, CA 94305, U.S.A. e-mail: visheshj@stanford.edu
ASHWIN SAH
Affiliation:
Simons Building (Building 2), 77 Massachusetts Avenue, Cambridge MA 02139, U.S.A. e-mails: asah@mit.edu, msawhney@mit.edu
MEHTAAB SAWHNEY
Affiliation:
Simons Building (Building 2), 77 Massachusetts Avenue, Cambridge MA 02139, U.S.A. e-mails: asah@mit.edu, msawhney@mit.edu
Rights & Permissions [Opens in a new window]

Abstract

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-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 $\{\pm 1\}$-matrices over $\mathbb{F}_p$ for primes $2 < p \leq \exp(O(n^{1/4}))$. Previously, such estimates were available only for $p = o(n^{1/8})$. 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 $\mathbb{F}_p^{n}$ with anticoncentration at least $1/p + \Omega(1/p^2)$. Previously, inverse Littlewood–Offord-type results only allowed control over vectors with anticoncentration at least $C/p$ for some large constant $C > 1$.

Information

Type
Research Article
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of Cambridge Philosophical Society