2000 character limit reached
Erdős' minimum overlap problem
Published 14 Jan 2022 in math.CO, math.NT, and math.OC | (2201.05704v1)
Abstract: We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.
Paper Prompts
Sign up for free to create and run prompts on this paper.