Composite factors of binomials and linear systems in roots of unity
- 3 Downloads
In this paper we completely classify binomials in one variable which have a nontrivial factor which is composite, i.e., of the shape g(h(x)) for polynomials g, h both of degree > 1. In particular, we prove that, if a binomial has such a composite factor, then deg g ≤ 2 (under natural necessary conditions). This is best-possible and improves on a previous bound deg g ≤ 24.
This result provides evidence toward a conjecture predicting a similar bound when binomials are replaced by polynomials with any given number of terms.
As an auxiliary result, which could have other applications, we completely classify the solutions in roots of unity of certain systems of linear equations.
Unable to display preview. Download preview PDF.
- A. Schinzel, Polynomials with Special Regard to Reducibility, Encyclopedia of Mathematics and its Applications, Vol. 77, Cambridge University Press, Cambridge, 2000.Google Scholar