The Setting
A signing of length is a vector with every entry or , and is its Littlewood polynomial. The question is how small the ratio of the maximum of on the circle to can be kept as grows.
Relaxing the signs to the cube turns this into an approximation problem: find coefficient vectors that are nearly signings, their entries mostly near , whose polynomials have maximum modulus on the circle close to . Theorem 1 below, an almost-sign approximation, gives such vectors at every length, with the closeness controlled by a parameter .
Phases, Polynomials and Energy
For a real number , the phase is the complex number , the point of the unit circle at angle .✦ The phase of period of a real number is the complex number (1) and parametrizes the unit circle by .
For a coefficient vector in , the trigonometric polynomial of is the function on given by (2) for a signing it is the Littlewood polynomial on the circle, . The maximum modulus of is .
The normalized energy of a vector is the mean of the squares of its entries. On the cube it equals exactly at the signings, and is smaller at every other vector.
For , the constant is the number (3) which exceeds and tends to as .
The Claim
Theorem 1. Let . There are vectors in , one for each length , a real number and a constant such that (4)✦
In the paper, the result reads: for every there are vectors , one for each , with and .
The theorem sharpens the limit superior in the paper’s form to a bound at every length with error , and the limit inferior to an actual limit of the normalized energy.
What Is Checked
The claim is stated over real coefficient vectors of every length and their trigonometric polynomials (2), built from the phase at , for a parameter .