Abstract
A Newman polynomial has all the coefficients in and constant term 1, whereas a Littlewood polynomial has all coefficients in . We call a Borwein polynomial if all its coefficients belong to and . By exploiting an algorithm which decides whether a given monic integer polynomial with no roots on the unit circle has a non-zero multiple in with coefficients in a finite set , for every Borwein polynomial of degree at most 9 we determine whether it divides any Littlewood or Newman polynomial. In particular, we show that every Borwein polynomial of degree at most 8 which divides some Newman polynomial divides some Littlewood polynomial as well. In addition to this, for every Newman polynomial of degree at most 11, we check whether it has a Littlewood multiple, extending the previous results of Borwein, Hare, Mossinghoff, Dubickas and Jankauskas.
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.