On the number of reducible polynomials of bounded naive height (Q404022): Difference between revisions

For given positive integers \(d\) and \(T\), let \(N(d,T)\) denote the number of univariate reducible (over \(\mathbb Q\)) polynomials whose coefficients are integers with absolute value at most \(T\). \textit{G. Kuba} [Math. Slovaca 59, No. 3, 349--356 (2009; Zbl 1212.11086)] has shown that one has \[ T^d \ll N(d,T) \ll T^d\,\mathrm{ as }\, T\to \infty \] for \(d\geq 3\) and \[ T^2\log T \ll N(2,T) \ll T^2\log T\,\mathrm{ as }\, T\to \infty. \] The present author makes precise these relations by proving the asymptotic formulæ\ \(N(d,T)=k_d T^d +O(T^{d-1})\) for \(d\geq 4\), \(N(3,T)=k_3 T^3 +O(T^{2}(\log T)^2)\), and \(N(2,T)=6(3\sqrt{5}+2\log (1+\sqrt{5})-\log 4)\cdot \pi^{-2}T^2\log T+O(T^2)\). The constants \(k_d\) (\(d\geq 3\)) are explicitly given in terms of some infinite Dirichlet series involving the volumes of some symmetric convex bodies in \(\mathbb R^d\).