Irreducibility of Random Polynomials

References

• [Arratia and DeSalvo 13] R. Arratia and S. DeSalvo. “On the Singularity of Random Bernoulli Matrices: Novel Integer Partitions and Lower Bound Expansions.” Ann. Comb. 17:2 (2013), 251–274.
   Web of Science ®Google Scholar
• [Bary-Soroker and Kozma 17] L. Bary-Soroker, and G. Kozma. “Is a bivariate polynomial with ± 1 coefficients irreducible? Very likely!” Int. J. Number Theory 13:4 (2017), 933–936.
   Web of Science ®Google Scholar
• [Bourgain et al. 10] J. Bourgain, V. H. Vu, and P. M. Wood. “On the Singularity Probability of Discrete Random Matrices.” J. Funct. Anal. 258:2 (2010), 559–603.
   Web of Science ®Google Scholar
• [Chela 63] R. Chela.“Reducible Polynomials.” J. London Math. Soc. 38 (1963), 183–188.
   Google Scholar
• [Dietmann 13] R. Dietmann. “Probabilistic Galois Theory.” Bull. Lond. Math. Soc. 45:3 (2013), 453–462.
   Google Scholar
• [Gallagher 72] P. X. Gallagher. “The Large Sieve and Probabilistic Galois Theory.” in Analytic number theory (Proc. Sympos. Pure Math., Vol. XXIV, St. Louis Univ., St. Louis, MO, 1972), 91–101, Amer. Math. Soc., Providence, RI.
   Google Scholar
• [Gorodnik and Nevo 11] A. Gorodnik and A. Nevo. “Splitting Fields of Elements in Arithmetic Groups.” Math. Res. Lett. 18:6 (2011), 1281–1288.
   Web of Science ®Google Scholar
• [Kahn et al. 95] J. Kahn, J. Komlós, and E. Szemerédi. “On the Probability That a Random ± 1-Matrix Is Singular.” J. Amer. Math. Soc. 8:1 (1995), 223–240.
   Web of Science ®Google Scholar
• [Komlós 67] J. Komlós. “On the Determinant of (0, 1) Matrices.” Studia Sci. Math. Hungar 2 (1967), 7–21.
   Google Scholar
• [Knobloch 55] H.-W. Knobloch. “Zum Hilbertschen Irreduzibilitätssatz.” Abh. Math. Sem. Univ. Hamburg 19 (1955), 176–190.
   Google Scholar
• [Knobloch 56] H.-W. Knobloch. “Die Seltenheit der Reduziblen Polynome.” Jber. Deutsch. Math. Verein. 59:Abt. 1 (1956), 12–19.
   Google Scholar
• [Konyagin 99] S. V. Konyagin. “On the Number of Irreducible Polynomials with 0,1, Coefficients.” Acta Arith. 88:4 (1999), 333–350.
   Web of Science ®Google Scholar
• [Kuba 09] G. Kuba. “On the Distribution of Reducible Polynomials.” Mathematica Slovaca 59:3 (2009), 349–356
   Web of Science ®Google Scholar
• [Litzkow 87] M. Litzkow. “Remote Unix - Turning Idle Workstations into Cycle Servers.” Proc. Usenix Summer Conf. (1987), 381–384.
   Google Scholar
• [Moree 12] P. Moree. “Artin’s Primitive Root Conjecture: A Survey.” Integers 12:6 (2012), 1305–1416.
   Google Scholar
• [Odlyzko and Poonen 93] A. M. Odlyzko and B. Poonen. “Zeros of Polynomials with 0,1 Coefficients.” L’Enseignement Mathématique 39 (1993), 317–348.
   Google Scholar
• [O’Rourke and Wood 16] S. O’Rourke and P. M. Wood. Low-Degree Factors of Random Polynomials, arXiv preprint arXiv:1608.01938 (2016).
   Google Scholar
• [Peled et al. 16] R. Peled, A. Sen, O. Zeitouni. “Double Roots of Random Littlewood Polynomials.” Israel J. Math. 213:1 (2016), 55–77.
   Web of Science ®Google Scholar
• [Rivin 15] I. Rivin. Galois Groups of Generic Polynomials, available at arXiv:1511.06446, 19 Nov 2015.
   Google Scholar
• [Rivin 08] I. Rivin. “Walks on Groups, Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms.” Duke Math. J. 142:2 (2008), 353–379.
   Web of Science ®Google Scholar
• [Tannenbaum et al. 02] T. Tannenbaum, D. Wright, K. Miller, and M. Livny. “Condor - A Distributed Job Scheduler.” In Beowulf Cluster Computing with Linux, edited by Thomas Sterling. Cambridge, MA: The MIT Press, 2002.
   Google Scholar
• [Tao and Vu 06] T. Tao and V. Vu. “On Random ± 1 Matrices: Singularity and Determinant.” Random Struct. Algorithms 28:1 (2006), 1–23.
   Web of Science ®Google Scholar
• [Tao and Vu 07] T. Tao and V. Vu. “On the Singularity Probability of Random Bernoulli Matrices.” J. Amer. Math. Soc. 20:3 (2007), 603–628.
   Web of Science ®Google Scholar
• [Thain et al. 05] D. Thain, T. Tannenbaum, and M. Livny. “Distributed Computing Practice: The Condor Experience.” Concurrency Comput. Pract. Experience 17:2–4 (2005), 323–356.
   Web of Science ®Google Scholar
• [van der Waerden 36] B. L. van der Waerden. “Die Seltenheit der Reduziblen Gleichungen und der Gleichungen mit Affekt.” Monatsh. Math. Phys. 43:1, (1936), 133–147.
   Google Scholar
• [Zywina 10] D. Zywina. Hilberts Irreducibility Theorem and the Larger Sieve, available at arXiv:1011.6465, 30 Nov 2010.
   Google Scholar