On certain multiples of Littlewood and Newman polynomials

2018/01/19 by Paulius Drungilas, Drungilas, P., Jonas Jankauskas +7
Computer Science · Mathematics · #Polynomial and algebraic computation #Advanced Combinatorial Mathematics #Commutative Algebra and Its Applications

paper · pdf · doi:10.48550/arxiv.1801.07179

Abstract

Polynomials with all the coefficients in \ 0,1\ and constant term 1 are called Newman polynomials, whereas polynomials with all the coefficients in \ -1,1\ are called Littlewood polynomials. By exploiting an algorithm developed earlier, we determine the set of Littlewood polynomials of degree at most 12 which divide Newman polynomials. Moreover, we show that every Newman quadrinomial X^a+X^b+X^c+1, 15>a>b>c>0, has a Littlewood multiple of smallest possible degree which can be as large as 32765.

Related

• On the existence of Newman and Littlewood multiples for certain integer polynomials
• On Newman and Littlewood multiples of Borwein polynomials
• Algorithmic aspects of Newman polynomials and their divisors
• The Newman algorithm for constructing polynomials with restricted coefficients and many real roots
• On Newman and Littlewood polynomials with prescribed number of zeros\n inside the unit disk