The characteristic polynomial of a random matrix

Abstract

Form an $n\times n$ matrix by drawing entries independently from $\{\pm 1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\varphi$ be the characteristic polynomial. Conditionally on the extended Riemann hypothesis, with high probability $\varphi$ is irreducible and $\mathrm{Gal}(\varphi )\ge A_n$.

arXiv comment27 pages. Final version following referee's comments

References in corpus (9)

• Irreducibility of random polynomials of large degree
• Irreducible polynomials of bounded height
• Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
• Irreducibility of random polynomials: general measures
• Singularity of Random Matrices over Finite Fields
• Invariable generation of the symmetric group
• Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability
• Some new results in random matrices over finite fields
• The singularity probability of a random symmetric matrix is exponentially small

Cited by in corpus (6)

• Winding Number Statistics for Chiral Random Matrices: Averaging Ratios of Determinants with Parametric Dependence
• Winding Number Statistics for Chiral Random Matrices: Averaging Ratios of Parametric Determinants in the Orthogonal Case
• Galois groups of random additive polynomials
• Universality for low degree factors of random polynomials over finite fields
• Irreducibility of the characteristic polynomials of random tridiagonal matrices
• Counting matrices over finite rank multiplicative groups