Overview
- Must a reducible five-term Newman polynomial have a root of unity?
- Which cyclotomic divisors suffice when such a factor exists?
Definition
A normalized five-term Newman polynomial has the form
The constant term 1 excludes the forced factor . Mercer conjectures that reducibility over forces a cyclotomic factor. The corresponding statements for three and four terms are known.
References 1
- Mercer2012Newman · §3, Proposition 5 and Conjecture 6, p. 5Source
Cyclotomic factors
Koley–Reddy prove that if such an has a cyclotomic factor, at least one such divisor has the form or , for positive integers . Mercer’s conjecture would supply the missing existence assertion for reducible .
References 1
- KoleyReddy2019Cyclotomic · Conjectures 1.2–1.3; Theorem 3.2 and the reduction preceding §2Source
Example
The restriction on the number of terms is essential to this formulation. Multiplication gives
It is reducible and has no cyclotomic factor: neither nor vanishes at a root of unity. The same example is recorded by Mercer.
References 1
- Mercer2012Newman · §6, following Proposition 15, p. 13Source
Questions
Must a reducible five-term Newman polynomial have a cyclotomic factor?
Scope. , integers , over .
This is Mercer’s Conjecture 6 (2012), restated as Conjecture 1.2 by Koley–Reddy (2019). Their proved theorem instead guarantees a divisor from the two specified cyclotomic families, assuming a cyclotomic factor exists.
References 2
- Mercer2012Newman · Conjecture 6, p. 5Source
- KoleyReddy2019Cyclotomic · Conjecture 1.2Source
Related topics
Trinomials
Sparse polynomials with fewer terms have stronger factorization theorems.
Related toStern polynomials
The Stern (0,1)-polynomials form another structured Newman family.
Linked from 1 articles
References
- Newman polynomials, reducibility, and roots on the unit circle
Mercer, Idris. Integers, 12, A6, 2012.
Read the source - Cyclotomic factors of Borwein polynomials
Koley, Biswajit and Reddy Arikatla, Satyanarayana. Bulletin of the Australian Mathematical Society, 100, 41–47, 2019.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.