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

f(x)=1+xs+xr+xm+xn,0<s<r<m<n.f(x)=1+x^s+x^r+x^m+x^n,\qquad 0<s<r<m<n.

The constant term 1 excludes the forced factor xx. Mercer conjectures that reducibility over Q\mathbb Q forces a cyclotomic factor. The corresponding statements for three and four terms are known.

References 1

Cyclotomic factors

Koley–Reddy prove that if such an ff has a cyclotomic factor, at least one such divisor has the form Φ5γ\Phi_{5^\gamma} or Φ2α3β\Phi_{2^\alpha3^\beta}, for positive integers α,β,γ\alpha,\beta,\gamma. Mercer’s conjecture would supply the missing existence assertion for reducible ff.

References 1

Example

The restriction on the number of terms is essential to this formulation. Multiplication gives

(1+x+x3)(1+x4+x9)=1+x+x3+x4+x5+x7+x9+x10+x12.(1+x+x^3)(1+x^4+x^9)=1+x+x^3+x^4+x^5+x^7+x^9+x^{10}+x^{12}.

It is reducible and has no cyclotomic factor: neither 1+x+x31+x+x^3 nor 1+x4+x91+x^4+x^9 vanishes at a root of unity. The same example is recorded by Mercer.

References 1

Questions

OpenPolynomial families

Must a reducible five-term Newman polynomial have a cyclotomic factor?

Scope. f=1+xs+xr+xm+xnf=1+x^s+x^r+x^m+x^n, integers 0<s<r<m<n0<s<r<m<n, over Q\mathbb Q.

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
Discuss this question →

Related topics

References

  1. Newman polynomials, reducibility, and roots on the unit circle

    Mercer, Idris. Integers, 12, A6, 2012.

    Read the source
  2. Cyclotomic factors of Borwein polynomials

    Koley, Biswajit and Reddy Arikatla, Satyanarayana. Bulletin of the Australian Mathematical Society, 100, 41–47, 2019.

    Read the source