On the number of integer polynomials with multiplicatively dependent roots
classification
🧮 math.NT
keywords
boundsdependentintegerlowermultiplicativelypolynomialsrootsupper
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.