The characteristic polynomial of a random matrix
Let \(M_n\) denote an \(n\times n\) random matrix whose entries are independent identically distributed Rademacher random variables (taking values \(\pm 1\) with probability 1/2). In various papers this is referred as the random sign matrix or Bernoulli matrix. Let \(p_n\) be the probability that \(M_n\) is singular. \textit{J. Komlós} [Stud. Sci. Math. Hungar. 2, 7--21 (1967; Zbl 0153.05002)] proved that \(p_n=o(1)\) as \(n\to \infty.\) For improved bounds and related results, see the survey paper of \textit{V. H. Vu} [Probab. Surv. 18, 179--200 (2021; Zbl 07367835)]. Finally, \textit{K. Tikhomirov} [Ann. of Math. (2) 191, 593--634 (2020; Zbl 1458.15023)] proved that \(p_n=(\frac {1}{2}+o(1))^n.\)\par \textit{L. Babai} (already in the 1970s) resp. \textit{V. H. Vu} and \textit{P. M. Wood} (2009) conjectured that the characteristic polynomial \(\varphi (t)\) of \(M_n\) is irreducible in \(\mathbb{Z}[t]\) with high probability.\par In the paper under review the author considers the above problem for any fixed nontrivial finitely supported measure \(\mu\) on \(\mathbb{Z}\) when the entries of \(M_n(\mu)\) are independent with distribution \(\mu\). The author proves the conjecture under different conditions in two theorems:\par Theorem 1.2. Assume that there are four distinct primes \(p_1, p_2, p_3,\) and \(p_4\) such that \(\mu \mod (p_1p_2p_3p_4)\) is uniform. Then with high probability \(\varphi\) is irreducible and Gal(\(\varphi\))\(\ge A_n\).\par Theorem 1.3. Assume the extended Riemann hypothesis (for the Dedekind zeta function in all number fields). Then with high probability \(\varphi\) is irreducible and Gal(\(\varphi\))\(\ge A_n\). Quantitatively, \({\boldsymbol P}(\varphi \;\text{irreducible)} = 1 - O(e^{-cn}),\) \({\boldsymbol P}(\text{Gal}(\varphi)\ge A_n) = 1 - O(e^{-c\sqrt n})\) where \(c\) and the implicit constants depend on \(\mu\). \par In the proofs the author adapts the methods of \textit{L. Bary-Soroker} and \textit{G. Kozma} [Duke Math. J. 169, 579--598 (2020; Zbl 1447.11112)] resp. of \textit{E. Breuillard} and \textit{P. P. Varjú} [Acta Math. 223, 195--249 (2019; Zbl 1459.11079)] for proving the conjecture of \textit{A. M. Odlyzko} and \textit{B. Poonen} [Enseign. Math. 39, 317--348 (1993; Zbl 0814.30006)] concerning random polynomials.
- Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
- Irreducibility of random polynomials of large degree
- Irreducibility of Random Polynomials
- Irreducibility of random polynomials: general measures
- How random is the characteristic polynomial of a random matrix ?
- Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
- High-dimensional probability. An introduction with applications in data science
- How random is the characteristic polynomial of a random matrix ?
- scientific article; zbMATH DE number 5652361 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3245540 (Why is no real title available?)
- Invariable generation of the symmetric group
- Irreducibility of random polynomials of large degree
- Irreducible polynomials of bounded height
- Limits of logarithmic combinatorial structures.
- Logarithmic combinatorial structures: A probabilistic approach
- Low-degree factors of random polynomials
- On random ±1 matrices: Singularity and determinant
- On the number of matrices with given characteristic polynomial
- On the singularity of random symmetric matrices
- On the singularity probability of discrete random matrices
- Random matrices have simple spectrum
- Random symmetric matrices are almost surely nonsingular.
- Singularity of random Bernoulli matrices
- Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
- Singularity of random symmetric matrices revisited
- Some new results in random matrices over finite fields
- Surjectivity of near-square random matrices
- The spectral radii and norms of large dimensional non-central random atrices matrices
- Zeros of polynomials with 0, 1 coefficients
- Characteristic polynomials of complex random matrix models
- Note on graphs with irreducible characteristic polynomials
- Characteristic polynomials for random band matrices near the threshold
- The characteristic polynomial of a random permutation matrix at different points
- Averages of characteristic polynomials in random matrix theory
- scientific article; zbMATH DE number 741197 (Why is no real title available?)
- Critical Points of Random Polynomials and Characteristic Polynomials of Random Matrices
- Maximum of the characteristic polynomial of random unitary matrices
- Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
- 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
- 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
- Efficient computations in central simple algebras using Amitsur cohomology
- Counting matrices over finite rank multiplicative groups
- Irreducibility of the characteristic polynomials of random tridiagonal matrices
- Sparse graph signals -- uncertainty principles and recovery
- Galois groups of random polynomials over the rational function field
- A random polynomial with multiplicative coefficients is almost surely irreducible
This page was built for publication: The characteristic polynomial of a random matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095113)
