On the number of polynomials of bounded height that satisfy Dumas's criterion

Abstract

We study integer coefficient polynomials of fixed degree and maximum height H, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as H approaches infinity. We also show that, for a fixed degree, the density of Dumas polynomials in all irreducible integer coefficient polynomials is strictly less than 1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…