Skip to main content
SpringerLink
Log in

Polynomials Irreducible by Eisenstein's Criterion

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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

  2. Dörge, K.: Ein Beitrag zur Theorie der diophantischen Gleichungen mit zwei Unbekannten. Math. Z. 24, 193–198 (1926)

    Google Scholar 

  3. Knobloch, H.W.: Zum Hilbertschen Irreduzibilitätssatz. Abh. Math. Sem. Univ. Hamburg 19, 176–190 (1955)

    MathSciNet  Google Scholar 

  4. Konyagin, S.V.: On the number of irreducible polynomials with 0,1 coefficients. Acta Arith. 88, 333–350 (1999)

    MathSciNet  MATH  Google Scholar 

  5. 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)

    MATH  Google Scholar 

  6. Lang, S.: Algebra. Reading, MA: Addison–Wesley, 1965

  7. Mignotte, M., Glesser, P.: Landau's inequality via Hadamard's. J. Symbolic Comp. 18, 379–383 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Schinzel, A.: Reducibility of lacunary polynomials I. Acta Arith. 16, 123–159 (1969)

    MATH  Google Scholar 

  9. Schinzel, A.: Polynomials with special regard to irreducibility. Cambridge: Cambridge University Press 2000

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Informatics, Vilnius University, Naugarduko 24, 2600, Vilnius, Lithuania

    Artūras Dubickas

Authors
  1. Artūras Dubickas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Artūras Dubickas.

Additional information

Keywords: Irreducible polynomial, Eisenstein's Criterion.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-003-0131-7

Keywords

Search

Navigation