ErdH{o}s' minimum overlap problem
classification
🧮 math.CO
math.NTmath.OC
keywords
problemminimumoverlapanalysisapproachaskedboundconvex
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
AI-Assisted Discovery of Convex Relaxations via Dual Agents
Dual AI agents (coding and theory) discover convex relaxations improving certified lower bounds on the first autocorrelation inequality (C6.2) to 1.2937 and Erdős minimum-overlap constant (C6.5) to 0.37912, verified b...
-
Artificial Intelligence for Mathematical Reasoning: An Integrated Survey of Language Models, Neuro-symbolic Systems, and Verified Discovery
An integrated survey organizing AI mathematical reasoning into informal, formal, discovery, and technique axes while cataloging benchmarks and assessing failure modes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.