Abstract.
We compute the probability for a monic univariate integer polynomial to be irreducible by Eisenstein's Criterion. In particular, it follows that less than 1% of the polynomials with at least seven non-zero coefficients are irreducible by Eisenstein.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Dobbs, D.E., Johnson, L.E.: On the probability that Eisenstein's criterion applies to an arbitrary irreducible polynomial. In: Dobbs, D.E. et al. (eds.) Advances in commutative ring theory. Proc. of 3 rd Intern. Conf., Fez, Morocco. Lect. Notes in Pure Appl. Math. Vol. 205, New York: Marcel Dekker, 1999, pp. 241–256
Dörge, K.: Ein Beitrag zur Theorie der diophantischen Gleichungen mit zwei Unbekannten. Math. Z. 24, 193–198 (1926)
Knobloch, H.W.: Zum Hilbertschen Irreduzibilitätssatz. Abh. Math. Sem. Univ. Hamburg 19, 176–190 (1955)
Konyagin, S.V.: On the number of irreducible polynomials with 0,1 coefficients. Acta Arith. 88, 333–350 (1999)
Landau, E.: Sur quelques thèorémes de M. Petrovic relatifs aux zéros des fonctions analytiques. Bull. Math. Soc. France 33, 251–261 (1905)
Lang, S.: Algebra. Reading, MA: Addison–Wesley, 1965
Mignotte, M., Glesser, P.: Landau's inequality via Hadamard's. J. Symbolic Comp. 18, 379–383 (1994)
Schinzel, A.: Reducibility of lacunary polynomials I. Acta Arith. 16, 123–159 (1969)
Schinzel, A.: Polynomials with special regard to irreducibility. Cambridge: Cambridge University Press 2000
Author information
Authors and Affiliations
Corresponding author
Additional information
Keywords: Irreducible polynomial, Eisenstein's Criterion.
Rights and permissions
About this article
Cite this article
Dubickas, A. Polynomials Irreducible by Eisenstein's Criterion. AAECC 14, 127–132 (2003). https://doi.org/10.1007/s00200-003-0131-7
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s00200-003-0131-7