English

Coefficients of squares of Newman polynomials

Number Theory 2008-12-07 v2 Combinatorics

Abstract

We show that there are polynomials pNp_N of arbitrarily large degree NN, with coefficients equal to 0 or 1 (Newman polynomials), such that lim infNN\LinfpN2/pN2(1)<1, \liminf_{N \to \infty} N \Linf{p_N^2} \bigl / p_N^2(1) < 1, where \Linfq\Linf{q} denotes the maximum coefficient of the polynomial qq and which, at the same time, are sparse: pN(1)/N0p_N(1)/N \to 0. This disproves a conjecture of Yu \cite{yu}. We build on some previous results of Berenhaut and Saidak \cite{berenhaut-saidak} and Dubickas \cite{dubickas} whose examples lacked the sparsity. This sparsity we create from these examples by randomization.

Keywords

Cite

@article{arxiv.0806.1809,
  title  = {Coefficients of squares of Newman polynomials},
  author = {Mihail N. Kolountzakis},
  journal= {arXiv preprint arXiv:0806.1809},
  year   = {2008}
}

Comments

Correction of small errors; *Acknowledgement of priority* Results stronger than those contained in this paper, with similar methods, have been obtained by Javier Cilleruelo (cited) before my paper was written. My paper will not be published. Please do not cite it

R2 v1 2026-06-21T10:49:28.115Z