Littlewood polynomials with high order zeros

Berend, Daniel; Golan, Shahar

doi:10.1090/S0025-5718-06-01848-5

Littlewood polynomials with high order zeros
HTML articles powered by AMS MathViewer

by Daniel Berend and Shahar Golan PDF

Math. Comp. 75 (2006), 1541-1552 Request permission

Abstract:

Let $N^{*}(m)$ be the minimal length of a polynomial with $\pm 1$ coefficients divisible by $(x-1)^m$. Byrnes noted that $N^{*}(m)\leq 2^m$ for each $m$, and asked whether in fact $N^{*}(m)=2^m$. Boyd showed that $N^{*}(m) = 2^{m}$ for all $m \le 5$, but $N^{*}(6) = 48$. He further showed that $N^*(7)=96$, and that $N^{*}(8)$ is one of the 5 numbers $96, 144, 160, 176$, or $192$. Here we prove that $N^{*}(8) = 144$. Similarly, let $m^*(N)$ be the maximal power of $(x-1)$ dividing some polynomial of degree $N-1$ with $\pm 1$ coefficients. Boyd was able to find $m^*(N)$ for $N<88$. In this paper we determine $m^*(N)$ for $N<168$.

References

Jean-Paul Allouche and Jeffrey Shallit, The ubiquitous Prouhet-Thue-Morse sequence, Sequences and their applications (Singapore, 1998) Springer Ser. Discrete Math. Theor. Comput. Sci., Springer, London, 1999, pp. 1–16. MR 1843077
David W. Boyd, On a problem of Byrnes concerning polynomials with restricted coefficients, Math. Comp. 66 (1997), no. 220, 1697–1703. MR 1433263, DOI 10.1090/S0025-5718-97-00892-2
David W. Boyd, On a problem of Byrnes concerning polynomials with restricted coefficients. II, Math. Comp. 71 (2002), no. 239, 1205–1217. MR 1898751, DOI 10.1090/S0025-5718-01-01360-6
J. S. Byrnes and Jennifer L. Byrnes (eds.), Recent advances in Fourier analysis and its applications, NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences, vol. 315, Kluwer Academic Publishers Group, Dordrecht, 1990. MR 1081341, DOI 10.1007/978-94-009-0665-5
J.S. Byrnes and D.J. Newman, Null steering employing polynomials with restricted coefficients, IEEE Trans. Antennas and Propagation 36 (1988), 301–303.
S. Golan, http://www.cs.bgu.ac.il/$\sim$golansha/polynomials.
Rudolf Lidl and Harald Niederreiter, Finite fields, Encyclopedia of Mathematics and its Applications, vol. 20, Addison-Wesley Publishing Company, Advanced Book Program, Reading, MA, 1983. With a foreword by P. M. Cohn. MR 746963
Vitaly Skachek, Tuvi Etzion, and Ron M. Roth, Efficient encoding algorithm for third-order spectral-null codes, IEEE Trans. Inform. Theory 44 (1998), no. 2, 846–851. MR 1607751, DOI 10.1109/18.661533
Albert Nijenhuis and Herbert S. Wilf, Combinatorial algorithms, 2nd ed., Computer Science and Applied Mathematics, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], New York-London, 1978. For computers and calculators. MR 510047
R.M. Roth, P.H. Siegel, and A. Vardy, High-order spectral-null codes: Constructions and bounds, IEEE Trans. Inform. Theory 35 (1989), 463–472.
Ron M. Roth, Spectral-null codes and null spaces of Hadamard submatrices, Des. Codes Cryptogr. 9 (1996), no. 2, 177–191. MR 1409444, DOI 10.1007/BF00124592
Lawrence C. Washington, Introduction to cyclotomic fields, Graduate Texts in Mathematics, vol. 83, Springer-Verlag, New York, 1982. MR 718674, DOI 10.1007/978-1-4684-0133-2