Counting integer polynomials with several roots of maximal modulus

For a polynomial \(f\) of degree \(n\geq 1\) over the field \(\mathbb C\) of complex numbers, recall that the largest modulus of the roots of \(f,\) is called the inclusion radius of \(f,\) and denoted by \(r(f)=\displaystyle\max_{1\leq i\leq n}|\alpha_i|,\) where \(\alpha_i, 1\leq i\leq n\) are the roots of \(f\) (not necessarily distinct) and the roots with modulus \(r(f)\) are said to be dominant. Further, the height of \(f\) is the maximum of the absolute values of its coefficients. For any positive integers \(H\) and \(k\leq n,\) let \(D_n(k, H)\) denote the number of monic integer polynomials \(f\) of degree \(n\) and height at most \(H\) with exactly \(k\) roots (not necessarily distinct) of maximal modulus. In this article, some upper and lower bounds for \(D_n(k, H), n\geq k\geq 3, H\geq 1\) are obtained (see Theorem 1.1). \N\NInvestigating more about \(D_n(k, H),\) let \(I_n(k, H)\) (resp. \(R_n(k, H)\)) denote the number of monic irreducible (resp. reducible) integer polynomials \(f\) of degree \(n\) and height at most \(H\) with exactly \(k\) roots (not necessarily distinct) of maximal modulus. Then \(D_n(k, H)=I_n(k, H)+R_n(k, H)\) and that the sizes of \(I_n(k, H), R_n(k, H)\) are separately considered in Theorems 1.2 and 1.3 respectively. \N\NThe results in this article imply, for instance, that the number of monic integer irreducible polynomials of degree \(n\) and height at most \(H\) whose \(n\) roots all have the same modulus is approximately \(2H\) for odd \(n,\) while for even \(n\) there are more than \(H^{n/8}\) such polynomials. \N\NIt must be mentioned here that the article is interesting, auxiliary results are also informative and the presentation is exquisite.

Cites work

This page was built for publication: Counting integer polynomials with several roots of maximal modulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956978)