Special quadrature error estimates and their application in the hardy-littlewood majorant problem
S\'andor Krenedits

TL;DR
This paper advances the understanding of the Hardy-Littlewood majorant problem by proving new error estimates for special quadrature methods, specifically for certain trigonometric polynomial sums, extending previous results to the case k=5.
Contribution
The authors develop refined quadrature error estimates using total variation and integral mean bounds, successfully extending the validity of Mockenhaupt's conjecture to the case k=5.
Findings
Proved the k=5 case of Mockenhaupt's conjecture for the Hardy-Littlewood majorant problem.
Developed specialized quadrature error bounds using total variation and integral mean estimates.
Achieved better constants in error bounds for specific trigonometric polynomial functions.
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 there exist counterexamples even among idempotent polynomials. This was proved recently by Mockenhaupt and Schlag with some four-term idempotents. However, Mockenhaupt conjectured that even the classical 1 + e^{2\piix} \pm e^{2\pii(k+2)x} three- term character sums, should work for all 2k < p < 2k+2 and for all k \in N. In two previous papers we proved this conjecture for k = 0; 1; 2; 3; 4, i.e. in the range 0 < p < 10, p \notin 2N. Here we demonstrate that even the k = 5 case holds true. Refinements in the technical features of our approach include use of total variation and integral mean estimates in error bounds for a certain fourth order quadrature. Our estimates make good use of the special forms of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
