2000 character limit reached
Counting integer polynomials with several roots of maximal modulus (2409.08625v1)
Published 13 Sep 2024 in math.NT
Abstract: In this paper, for positive integers $H$ and $k \leq n$, we obtain some estimates on the cardinality of the set of monic integer polynomials of degree $n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These include lower and upper bounds in terms of $H$ for fixed $k$ and $n$. We also count reducible and irreducible polynomials in that set separately. Our results imply, for instance, that the number of monic integer irreducible polynomials of degree $n$ and height at most $H$ whose all $n$ roots have equal moduli is approximately $2H$ for odd $n$, while for even $n$ there are more than $H{n/8}$ of such polynomials.