On the number of Eisenstein polynomials of bounded height

DOI10.1007/s00200-013-0187-yzbMath1278.11036arXiv1302.6094OpenAlexW1988858832MaRDI QIDQ360188

Randell Heyman, Igor E. Shparlinski

Publication date: 26 August 2013

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.6094

zbMATH Keywords

Eisenstein criterionirreducible polynomialarithmetic functions

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials (irreducibility, etc.) (11R09)

Related Items (9)

A local to global principle for expected values ⋮ On the number of reducible polynomials of bounded naive height ⋮ Geometric sieve over number fields for higher moments ⋮ Counting degenerate polynomials of fixed degree and bounded height ⋮ On the number of primes for which a polynomial is Eisenstein ⋮ On shifted Eisenstein polynomials ⋮ The density of shifted and affine Eisenstein polynomials ⋮ Unnamed Item ⋮ Eisenstein polynomials over function fields

Cites Work

• Polynomials irreducible by Eisenstein's criterion
• Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of Eisenstein polynomials of bounded height