A new bound for Erdős’ minimum overlap problem
From MaRDI portal
Publication:6136612
DOI10.4064/aa220728-7-6zbMath1520.05016OpenAlexW4385884287MaRDI QIDQ6136612
Publication date: 31 August 2023
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa220728-7-6
Convex programming (90C25) Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Trigonometric polynomials, inequalities, extremal problems (42A05)
Cites Work
- Unnamed Item
- Improved bounds on the supremum of autoconvolutions
- Applications of second-order cone programming
- Advances in the minimum overlap problem
- Generalized Sidon sets
- The supremum of autoconvolutions, with applications to additive number theory
- On optimal autocorrelation inequalities on the real line
- The number of squares and Bh[g sets]
- The Accuracy of Floating Point Summation
- On the overlap of a function with the translation of its complement
- On the minimal overlap problem of Erdös
- Unsolved problems in number theory
This page was built for publication: A new bound for Erdős’ minimum overlap problem