On Mockenhoupt's Conjecture in the Hardy-Littlewood Majorant Problem
Abstract
The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that even among the idempotent polynomials there must exist some counterex- amples, i.e. there exist some finite set of characters and some ? signs with which the signed character sum has larger pth norm than the idempotent obtained with all the signs chosen + in the character sum. That conjecture was proved recently by Mockenhaupt and Schlag. However, Mockenhaupt conjectured that even the classical 1 + e2?ix ? e2?i(k+2)x three- term character sums, used for p = 3 and k = 1 already by Hardy and Littlewood, should work in this respect. That remained unproved, as the construction of Mockenhaupt and Schlag works with four-term idempotents. In our previous work we proved this conjecture for k = 0; 1; 2, i.e. in the range 0 < p < 6, p =2 2N. Continuing this work here we demonstrate that even the k = 3; 4 cases hold true. Several refinement in the technical features of our approach include improved fourth order quadra- ture formulae, finite estimation of G02=G (with G being the absolute value square function of an idempotent), valid even at a zero of G, and detailed error estimates of approximations of various derivatives in subintervals, chosen to have accelerated convergence due to smaller radius of the Taylor approximation.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.