arXiv Analytics

Sign in

arXiv:1803.08755 [math.NT]AbstractReferencesReviewsResources

Counting decomposable polynomials with integer coefficients

Artūras Dubickas, Min Sha

Published 2018-03-23, updated 2021-08-25Version 2

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree and bounded height. Moreover, we obtain asymptotic formulas for the number of decomposable monic polynomials of even degree. For example, the number of monic sextic integer polynomials which are decomposable and of height at most $H$ is asymptotic to $(16\zeta(3)-5/4)H^3$ as $H \to \infty$.

Related articles: Most relevant | Search more
arXiv:1111.5404 [math.NT] (Published 2011-11-23)
Heights of divisors of x^n-1
arXiv:math/0603358 [math.NT] (Published 2006-03-14, updated 2006-12-12)
On the representation of integers by quadratic forms
arXiv:1706.04331 [math.NT] (Published 2017-06-14)
Averages of arithmetic functions over principal ideals