Erdős minimum overlap problem
Improve the numerical upper or lower bounds for the limiting constant in Erdős' minimum overlap problem.
0claims
0verified
Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.
6 shown
Improve the numerical upper or lower bounds for the limiting constant in Erdős' minimum overlap problem.
Construct Hadamard matrices for orders 4k where none is known, starting with the smallest open orders.
Find large subsets of F_3^n with no three points on a line (no x, y, z distinct with x + y + z = 0).
Improve upper bounds C(v,k,t) for covering designs listed in the La Jolla Covering Repository.