/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
import FormalConjectures.ErdosProblems.«36»Minimum Overlap Problem
The minimum overlap problem asks for the limit of the minimum, over all splittings of ${1, \ldots, 2n}$ into two sets $A$ and $B$ of equal size, of the maximum number of representations of any integer $k$ as $a - b$ with $a \in A$, $b \in B$, divided by $n$.
This file points to the canonical formalization in FormalConjectures.ErdosProblems.«36».