Algorithmic aspects of Newman polynomials and their divisors
Cybernetics and Information Technologies · 01.06.2026 · 55 (2) · 295-310
DOI: 10.2478/candc-2026-0010 ↗Kurz gefasst
Fachartikel in der Zeitschrift Cybernetics and Information Technologies, online erschienen am 31.10.2026. Verfasst von Musbahu Idris und 1 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
We study the problem of determining which integer polynomials divide Newman polynomials. First, we investigate the 8 438 known polynomials with Mahler measure less than 1.3. Apart from the polynomials having a positive real root, all but three of them are shown to divide a Newman polynomial of degree at most 1000. Second, using an algorithmic certification method of Hare and Mossingho, we exhibit several polynomials that divide no Newman polynomial. Among them is a degree-10 polynomial with Mahler measure approximately equal to 1.419404632, which improves the best known upper bound for any universal constant σ , if such a constant exists, governing the existence of Newman multiples in terms of Mahler measure. Finally, writing l ( x ) for the polynomial obtained from Lehmer’s polynomial by the substitution x ↦ − x , we explicitly construct Newman polynomials divisible by l ( x ) 2 with degrees up to 150, and show that no Newman polynomial of degree at most 160 is divisible by l ( x ) 3 .
Zitieren
APA
Idris, M., & Sac-Épée, J. (2026). Algorithmic aspects of Newman polynomials and their divisors. Cybernetics and Information Technologies, 55(2), 295-310. https://doi.org/10.2478/candc-2026-0010
Vancouver
Idris M, Sac-Épée J. Algorithmic aspects of Newman polynomials and their divisors. Cybernetics and Information Technologies. 2026;55(2):295-310. doi:10.2478/candc-2026-0010
BibTeX
@article{Idris2026,
author = {Idris, Musbahu and Sac-Épée, Jean-Marc},
title = {Algorithmic aspects of Newman polynomials and their divisors},
journal = {Cybernetics and Information Technologies},
year = {2026},
volume = {55},
number = {2},
pages = {295--310},
doi = {10.2478/candc-2026-0010}
}
EUVIMED