what is erdos-minimum-overlap-bound fr?

This repository is a math research note, not a piece of software you install and run day to day. It works on an old, unsolved question in number theory called the Erdos minimum overlap problem, which asks how small a certain kind of overlap between two sets of numbers can be made. Researchers narrow this down over time by proving upper and lower limits on the true answer, and this project claims a new, slightly tighter upper limit than the previous best published one from 2016. The way it works is by taking specific numerical constructions produced by other researchers and AI search systems competing on a public leaderboard, and then proving, using exact fraction arithmetic rather than approximate decimal numbers, that those constructions truly satisfy the mathematical rules required to count as valid. The authors are explicit that they did not invent the underlying constructions themselves. Their contribution is the proof method that takes someone else's numerical result and turns it into a fully verified, exact mathematical certificate, plus a small repair to one borderline construction that technically passed the leaderboard's own rules only due to a rounding quirk in floating point numbers. To check the claims yourself, you need Python 3.10 or newer, and everything runs using only Python's built-in standard library, no extra packages required. Running a make verify command checks the proofs and prints out whether each certificate holds. The project takes care to spell out exactly what it does and does not prove, including that the lower limit on the answer comes entirely from a different published paper and is simply quoted, not something this project improved. This is aimed at people already working in combinatorics or computer-assisted mathematical proof, not general programmers, and there is no ordinary application or user interface here, only a note, supporting code, and machine-checkable certificate files.