OpenAI preprint, September 2026 · §1. Introduction
Littlewood polynomials and the normalized minimum maximum:The polynomial
of a real vector
at a complex point
,
and the signings, vectors with every entry
Littlewood polynomials built from real coefficient vectors and
signings.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
Fix a length and signs , each equal to or . On the unit circle, with and in the circle , the polynomial with these coefficients is the trigonometric polynomial , whose mean square over is . The flatness problem asks how close to its maximum modulus can be brought by the choice of the signs.
The Definition
Definition 1. Let be a natural number. The polynomial of a coefficient vector of length with real entries is the function on the complex plane given by (1)✦A signing of length is a coefficient vector of length with real entries such that (2)✦ The Littlewood polynomial of a signing of length is the polynomial of .
In the paper, the result reads: a Littlewood polynomial of length is with every , the page’s for a signing ; its maximum modulus is , and is the minimum of over all choices of the signs.
What Is Checked
The definitions (1) and (2) are stated over a coefficient vector of length with real entries, for every natural number , and the polynomial(1) over every complex number .