OpenAI preprint, September 2026 · §1. Introduction
Theorem1.1:For every
and every large
,
some signing of length
has
on the unit circle
Real Littlewood polynomials with maximum modulus close to
..
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
The polynomial of a vector of real coefficients, indexed from , is the function of a complex variable given by (1) A signing of length is a vector of real numbers each equal to or , and is then the Littlewood polynomial of .
The question is how close to a choice of real signs can bring the maximum of on the unit circle as grows.
The Claim
Theorem 1. Let be a positive real number. There is an integer such that every integer has a signing of length with (2)✦
In the paper, the result reads: for Littlewood polynomials with real coefficients, , with the least value of over the signings of length ; equivalently, for every there is such that for every integer there are signs with .
What Is Checked
The claim (2) is stated over the signings of length and the polynomial (1) of a real coefficient vector, evaluated at every complex number of modulus .