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

DOI10.1017/S0305004122000226MaRDI QIDQ5877287zbMATH OpenOpenAlexWikidataFDO

Authors Asaf Ferber, Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

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

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

Recommendations

• The characteristic polynomial of a random matrix
• Irreducibility of Random Polynomials
• Random matrices: probability of normality
• Some new results in random matrices over finite fields
• Critical Points of Random Polynomials and Characteristic Polynomials of Random Matrices
• Low-degree factors of random polynomials
• Products and ratios of characteristic polynomials of random Hermitian matrices
• Jordan-Landau theorem for matrices over finite fields
• Norms of randomized circulant matrices
• The limit empirical spectral distribution of complex matrix polynomials

Cites work

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

Cited in

(12)

• The characteristic polynomial of a random matrix
• How random is the characteristic polynomial of a random matrix ?
• Galois groups of random additive polynomials
• Probabilistic Galois theory: the square discriminant case
• Nonvanishing minors of eigenvector matrices and consequences
• Counting matrices over finite rank multiplicative groups
• Irreducibility of the characteristic polynomials of random tridiagonal matrices
• Sparse graph signals -- uncertainty principles and recovery
• Local and global universality of random matrix cokernels
• Galois groups of random polynomials over the rational function field
• On the rank of a random symmetric matrix in the large-deviation regime
• Random symmetric matrices are almost surely nonsingular.

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

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