Counting integer polynomials with several roots of maximal modulus

Abstract

In this paper, for positive integers H and k ≤ 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 Hn/8 of such polynomials.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…