Composite lacunary polynomials and the proof of a conjecture of Schinzel

preprint2007arXivOpen access

Abstract

Let g(x)g(x) be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if g(h(x))g(h(x)) 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 g(x)=xdg(x)=x^d; 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 f(x)=g(h(x))f(x)=g(h(x)), where ff is a polynomial with a given number of terms and g,hg,h are arbitrary polynomials. As a corollary, this implies for instance that a polynomial with ll 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 Zl\Z^l.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.