Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
