Trinomials with given roots

From MaRDI portal



Abstract: We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these trinomials.


Let \(\Omega\) be a finite set of complex numbers. The main theorems of this article are on the number of monic trinomials (i.e, polynomials of the shape \(X^m + AX^n + B\), with \(m>n\) and \(A \neq 0\) and \(B\neq 0\)) vanishing at all elements of \(\Omega\). In the first theorem, a result of Evetrse, Schlickewei, and Schmidt on linear equations in multiplicative groups is used to show that if \(\Omega\) has at least \(3\) inequivalent elements, then the number of monic trinomials vanishing at every element of \(\Omega\) is bounded by an effective constant. Two complex numbers are called equivalent if their ratio is a root of unity. In the second theorem, assuming that the elements of \(\Omega\) generate an algebraic number field of degree \(d\), explicit upper bounds for the degree and height of trinomials vanishing at every element of \(\Omega\) are given. These bounds are expressed in terms of \(d\). The proof uses the theory of linear forms in logarithms.











This page was built for publication: Trinomials with given roots

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