On the number of integer polynomials with multiplicatively dependent roots

From MaRDI portal



Abstract: In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for various cases, although in general there is a logarithmic gap between lower and upper bounds.


Let \(f\in\mathbb{C}[X]\) be a complex polynomial. The height of \(f\) is the largest modulus of its coefficients. A polynomial of degree at least 2 is called degenerate if it has a pair of distinct nonzero roots whose quotient is a root of unity. Moreover \(f\) is called a generalized degenerate polynomial, if denoting by \(\alpha_1,\ldots,\alpha_t\) its distinct roots, there exist integers \(k_1,\ldots,k_t\) such that \(\alpha_1^{k_1}\ldots\alpha_t^{k_t}=1.\) The authors are obtaining results concerned with the estimation of the number of generalized degenerate polynomials of fixed degree and bounded height.











This page was built for publication: On the number of integer polynomials with multiplicatively dependent roots

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