Skip to main content Accessibility help
Hostname: page-component-59f8fd8595-gl4p7 Total loading time: 0 Render date: 2023-03-22T22:37:34.105Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

3 - Search for Ultraflat Polynomials with Plus and Minus One Coefficients

Published online by Cambridge University Press:  25 May 2018

Andrew Odlyzko
School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA
Steve Butler
Iowa State University
Joshua Cooper
University of South Carolina
Glenn Hurlbert
Virginia Commonwealth University
Get access


Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Connections in Discrete Mathematics
A Celebration of the Work of Ron Graham
, pp. 39 - 55
Publisher: Cambridge University Press
Print publication year: 2018

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)


1. J., Beck. Flat polynomials on the unit circle–Note on a problem of Littlewood. Bull. London Math. Soc. 23 (1991), 269–277.Google Scholar
2. E., Bombieri and J., Bourgain. On Kahane's ultraflat polynomials. J. Eur. Math. Soc. 11 (2009), 627–703.Google Scholar
3. P., Borwein. Computational Excursions in Analysis and Number Theory. Springer Science+Business Media, New York, 2002.Google Scholar
4. P., Borwein and M., Mossinghoff. Barker sequences and flat polynomials. pp. 71–88 in Number Theory and Polynomials, London Math. Soc. Lecture Note Ser., Vol. 352, Cambridge University Press, Cambridge, 2008. Available at (http:// Scholar
5. B., Bošković, F., Brglez, and J., Brest. Low-autocorrelation binary sequences: On improvedmerit factors and runtime predictions to achieve them. Appl. Soft Comput. 56 (July 2017), 262–285.Google Scholar
6. J., Brillhart and P., Morton. A case study in mathematical research: The Golay–Rudin–Shapiro sequence. Amer. Math. Monthly 103 (Dec. 1996), 854–869.Google Scholar
7. F.W., Carroll, D., Eustice, and T., Figiel. Theminimum modulus of polynomials with coefficients of modulus one. J. London Math. Soc., Ser. 2, 16 (1977), 76–82.Google Scholar
8. S. B., Ekhad and D., Zeilberger. Integrals involving Rudin-Shapiro polynomials and a sketch of a proof of Saffari's conjecture. 2016 preprint, available at (
9. E. H. el, Abdalaoui. On the Erdős flat polynomials problem, Chowla conjecture and Riemann Hypothesis. Preprint, version 2, 11 January 2017, available at (https://
10. T., Erdelyi. On the flatness of conjugate reciprocal unimodular polynomials. J. Math. Anal. Appl. 432, no. 2 (2015), 699–714.Google Scholar
11. P., Erdős. Some unsolved problems. Michigan Math. J. 4 (1957), 291–300.Google Scholar
12. P., Fan and M., Darnell. Sequence Design for Communications Applications. Research Studies Press, 1996.Google Scholar
13. A., Gersho, B., Gopinath, and A., Odlyzko. Coefficient inaccuracy in transversal filtering. Bell System Tech. J. 58 (1979), 2301–2316.Google Scholar
14. M. J. E., Golay. Static multislit spectrometry and its application to the panoramic display of infrared spectra. J. Opt. Soc. Amer. 41 (1951), 468–472.Google Scholar
15. M. J. E., Golay. Themerit factor of long lowautocorrelation binary sequences. IEEE Trans. Information Theory IT-28, no. 3 (1982), 543–549.
16. S.W., Golomb and G., Gong. Signal Design for Good Correlation for Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge, 2005.Google Scholar
17. G., Halasz. On a result of Salem and Zygmund concerning rand om polynomials. Studia Scient. Math. Hungar. 8 (1973), 369–377.Google Scholar
18. J., Jedwab, D. J., Katz, and K.-W., Schmidt. Advances in the merit factor problem for binary sequences. J. Combinatorial Theory, Ser. A 120 (2012), 882–906.Google Scholar
19. J.-P., Kahane. Sur les polynomes a coefficients unimodulaires. Bull. London Math. Soc. 12 (1980), 321–342.Google Scholar
20. T.W., Korner. On a polynomial of Byrnes. Bull. London Math. Soc. 12 (1980), 219–224.Google Scholar
21. K. H., Leung and B., Schmidt. The anti-field-descent method. J. Combinat. Theory, Ser. A 139 (April 2016), 87–131.Google Scholar
22. J. E., Littlewood. On polynomials. J. London Math. Soc. 41 (1966), 367–376.Google Scholar
23. J. E., Littlewood. Some Problems in Real and Complex Analysis. Heath, Lexington, MA, 1968.Google Scholar
24. I. D., Mercer. Autocorrelation and Flatness of Height One Polynomials. Ph.D. thesis, Simon Fraser University, 2005. Available at ( ∼idmercer/thesis.pdf).Google Scholar
25. H. L., Montgomery. Littlewood polynomials. In Analytic Number Theory: Modular Forms and q-Hypergeometric Series, G., Andrews and F., Garvan, eds., Springer Science+Business Media, forthcoming.
26. T., Packebusch and S., Mertens. Low autocorrelation binary sequences. J. Physics A: Mathematical and Theoretical 49 (2016), 165001.Google Scholar
27. S. D., Prestwich. Improved branch-and -bound for low autocorrelation binary sequences. available at (
28. L., Robinson. Polynomials with Plus or Minus One Coefficients: Growth Properties on the Unit Circle.M.S. thesis, Simon Fraser University, 1997. Available at (http://
29. B., Rodgers. On the distribution of Rudin-Shapiro polynomials. 2016 preprint, available at (
30. W., Rudin. Some theorems on Fourier coefficients. Proc. Amer. Math. Soc. 10 (1959), 855–859.Google Scholar
31. B., Saffari. Some polynomial extremal problems which emerged in the twentieth century. pp. 201–233 in J. S., Byrnes, ed., Twentieth Century Harmonic Analysis–A Celebration. Kluwer, Dordrecht, 2001.Google Scholar
32. M. R., Schroeder. Number Theory in Science and Communication: With Applications in Cryptography, Physics, Biology, Digital Information, and Computing, Springer-verlag, New York, 1984.Google Scholar
33. H. S., Shapiro, Extremal Problems for Polynomials and Power Series, M.S. thesis, MIT, 1951.Google Scholar
34. J., Spencer. Six stand ard deviations suffice. Trans. Amer. Math. Soc., 289, no. 2 (June 1985), 679–706.Google Scholar
35. N., Xiang and G. M., Sessler, eds. Acoustics, Information, and Communication: Memorial Volume in Honor of Manfred R. Schroeder. Springer Science+Business Media, New York, 2014.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the or variations. ‘’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats