On certain multiples of Littlewood and Newman polynomials

From MaRDI portal
Publication:4558079




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 Xa+Xb+Xc+1, 15>a>b>c>0, has a Littlewood multiple of smallest possible degree which can be as large as 32765.





Describes a project that uses

Uses Software





This page was built for publication: On certain multiples of Littlewood and Newman polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558079)