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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.