Abstract
We study integer coefficient polynomials of fixed degree and maximum height H
that are irreducible by the Dumas criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials as H → ∞. We also show that, for a fixed degree, the density of Dumas polynomials in the set of all
irreducible integer coefficient polynomials is strictly less than 1.
| Original language | English |
|---|---|
| Pages (from-to) | 1-7 |
| Number of pages | 7 |
| Journal | Journal of Integer Sequences |
| Volume | 17 |
| Issue number | 2 |
| Publication status | Published - 2014 |
Keywords
- Coprimality
- Dumas criterion
- Irreducible polynomial
Fingerprint
Dive into the research topics of 'On the number of polynomials of bounded height that satisfy the Dumas criterion'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver