The Setting
A Littlewood polynomial has every coefficient equal to or , and the flatness problem asks how small its maximum modulus on the unit circle can be for a given length . Real coefficients in are far easier to tune than signs, so a flat Littlewood polynomial can be sought in two steps: first a real coefficient vector whose polynomial is flat, then signs to replace the entries .
The result below, Lemma 2.2, controls the second step. The signs must keep the difference of the two polynomials small at every point of the unit circle at once, where and ; this is a discrepancy problem for the exponentials , uniform in . The lemma bounds this uniform error in terms of and of the defect mass of , which measures how far the entries of lie from and .
Signings and the Defect Mass
A real signing of length is a vector of real numbers each of which is or .
The polynomial of a real vector is the function of a complex variable given by (1)✦ and when is a real signing, is its Littlewood polynomial.
The defect mass of a real vector of length is the real number (2)✦
The Claim
Theorem 1. Let , and let be a real vector with for every . Then there is a real signing of length such that, for every complex number with , (3)✦ where the product under the square root is read as when .
In the paper, the result reads: there is an absolute constant such that for every and every some signs satisfy , the square-root term being zero when .
The theorem above gives this with , the point of the unit circle standing for the parameter .
What Is Checked
The claim (3) is stated over real vectors of length with every , the polynomial of (1) at points of the unit circle, real signings with their Littlewood polynomials, and the defect mass of (2).