A new bound for Erdős’ minimum overlap problem

DOI10.4064/AA220728-7-6zbMATH Open1520.05016OpenAlexW4385884287MaRDI QIDQ6136612FDOQ6136612

Authors: Ethan P. White 

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

Recommendations

• Advances in the minimum overlap problem
• An overlapping theorem with applications
• scientific article; zbMATH DE number 653274
• scientific article; zbMATH DE number 524120
• A bound on the overlap of same-sized subsets

zbMATH Keywords

Fourier analysisminimum overlap problemautoconvolution

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Trigonometric polynomials, inequalities, extremal problems (42A05)

Cites Work

• Applications of second-order cone programming
• Unsolved problems in number theory
• The number of squares and \(B_h[g]\) sets
• The Accuracy of Floating Point Summation
• Title not available (Why is that?)
• The supremum of autoconvolutions, with applications to additive number theory
• Generalized Sidon sets
• Improved bounds on the supremum of autoconvolutions
• On the minimal overlap problem of Erdös
• Advances in the minimum overlap problem
• On optimal autocorrelation inequalities on the real line
• On the overlap of a function with the translation of its complement

Cited In (4)

• A bound on the overlap of same-sized subsets
• Minimun overlap problem on finite groups
• Title not available (Why is that?)
• Reaching the bound in the \((2,n)\) merging problem

This page was built for publication: A new bound for Erdős’ minimum overlap problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136612)