The characteristic polynomial of a random matrix (Q2095113)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The characteristic polynomial of a random matrix
scientific article

    Statements

    The characteristic polynomial of a random matrix (English)
    0 references
    0 references
    9 November 2022
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    characteristic polynomial
    0 references
    Riemann hypothesis
    0 references
    irreducible
    0 references
    Galois group
    0 references
    0 references