Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 18 Sep 2013 in math.NT | (1309.4826v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.