Abstract
Let be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by Rényi and by Erdös, Schinzel had proved this in the special cases ; however that method does not extend to the general case. Here we prove the full Schinzel's conjecture (actually in sharper form) by a completely different method. Simultaneously we establish an "algorithmic" parametric description of the general decomposition , where is a polynomial with a given number of terms and are arbitrary polynomials. As a corollary, this implies for instance that a polynomial with terms and given coefficients is non-trivially decomposable if and only if the degree-vector lies in the union of certain finitely many subgroups of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.