A Littlewood polynomial of length is a polynomial whose coefficients all lie in . Its maximum modulus is . Let be the least value of over the Littlewood polynomials of length . Parseval’s identity gives for every . The real-sign analogue of a question of Erdős asks whether there is an absolute constant with for all large .
Erdős’s original question allows complex coefficients of modulus one. With such coefficients, Littlewood built polynomials from quadratic phases near the scale . A sequence of polynomials , of length and with coefficients of modulus one, is ultraflat when tends to uniformly on . Kahane constructed ultraflat polynomials. They answer the original question in the negative. Bombieri and Bourgain gave quantitative constructions of ultraflat polynomials. For real signs, the polynomials found by Shapiro and independently by Rudin are Littlewood polynomials. Their maximum modulus is . When is a power of two, their maximum modulus is at most . Balister proved that, at every length , the polynomial formed by the first coefficients of a longer polynomial of Shapiro and Rudin has maximum modulus at most . Balister, Bollobás, Morris, Sahasrabudhe and Tiba constructed Littlewood polynomials whose modulus lies between two fixed positive multiples of on the whole unit circle. Erdélyi proved that every Littlewood polynomial of length has . Georgiev, Gómez-Serrano, Tao and Wagner searched numerically for the real-sign minimum at degrees up to .
The main theorem of the preprint, Theorem 1.1, is that tends to as tends to infinity through all integers. The real-sign analogue of Erdős’s question therefore has a negative answer. The merit factor of a word in is , where . Turyn’s conjecture asserts that the merit factor is bounded by an absolute constant. From Theorem 1.1 the preprint also derives that the largest merit factor of a word in tends to infinity, disproving Turyn’s conjecture, a consequence the Lean library does not contain.
The Lean library Littlewood proves Theorem 1.1 in an equivalent form: for every there is such that for every some Littlewood polynomial of length has at every with . The Lean library also proves Corollary 7.1, flatness for every finite exponent: there are Littlewood polynomials , one of each length and each of least maximum modulus among those of its length, with for every real . The results on these pages are the Lean library’s, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every result of the Lean library. The Lean library is therefore the reference, and where the preprint states a result differently, that result’s page gives the Lean library’s statement with the preprint’s beside it. The preprint is a guide only: it gives the results their order and their names. The preprint quotes two combinatorial theorems, which the Lean library does not assume. An -uniform hypergraph is -nearly regular with small codegrees when, for some , each of its vertices lies in between and edges and each two of its vertices lie together in at most edges. Pippenger and Spencer proved that for every , when is small enough in terms of and , the edges of such a hypergraph split into at most matchings. In place of this edge-coloring theorem, the Lean library proves, as Theorem 3.2, a matching theorem in the form of Alon and Yuster: for every and every , such a hypergraph on vertices, in which each two vertices lie together in at most some edges with , has a matching that covers all but at most of its vertices, once is small enough and and are large enough in terms of , and . In place of the partial-coloring theorem of Lovett and Meka, the Lean library proves an entropy partial-coloring lemma of its own.
Littlewood is a Lean library: 19 items, in seven groups. Each has a page written by OctoInform, listed below.
No item matches.