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

DOI10.1017/S0305004122000226OpenAlexW3167537206WikidataQ114116789 ScholiaQ114116789MaRDI QIDQ5877287

Mehtaab Sawhney, Ashwin Sah, Vishesh Jain, Asaf Ferber

Publication date: 10 February 2023

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

characteristic polynomialRiemann hypothesis

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Relations with random matrices (11M50)

Cites Work

• Random matrices: tail bounds for gaps between eigenvalues
• Optimal inverse Littlewood-Offord theorems
• Random symmetric matrices are almost surely nonsingular.
• Zeros of polynomials with \(0, 1\) coefficients
• Recent progress in combinatorial random matrix theory
• Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
• The characteristic polynomial of a random matrix
• Rank of near uniform matrices
• Irreducible polynomials of bounded height
• Irreducibility of random polynomials of large degree
• Stein's method and the rank distribution of random matrices over finite fields
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• The Littlewood-Offord problem and invertibility of random matrices
• Quantum unique ergodicity for random bases of spectral projections
• On the counting problem in inverse Littlewood–Offord theory
• Singularity of random symmetric matrices revisited
• SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
• Invertibility of symmetric random matrices
• The Smallest Singular Value of Dense Random Regular Digraphs

This page was built for publication: Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial