/-
Copyright 2026 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.
-/modulepublicimportFormalConjecturesUtil
Ben Green's Open Problem 1:
a related question for sets of positive integers; see Green1.green_1 in
FormalConjectures.GreensOpenProblems.«1».
[AlKl90] Alon, N. and Kleitman, D. J., Sum-free subsets. A tribute to Paul Erdős (1990),
13-26.
PDF
[Be25b] Bedert, B., Large sum-free subsets of sets of integers via $L^1$-estimates for
trigonometric series. arXiv:2502.08624 (2025).
[Bo97] Bourgain, Jean, Estimates related to sumfree subsets of sets of integers. Israel J.
Math. 97 (1997), 71-92.
DOI
[EGM14] Eberhard, Sean and Green, Ben and Manners, Freddie, Sets of integers with no large
sum-free subset. Ann. of Math. (2) 180 (2014), 621-652.
[Er65] Erdős, P., Extremal problems in number theory. Proc. Sympos. Pure Math., Vol. VIII
(1965), 181-189. PDF
[Er73] Erdős, P., Problems and results on combinatorial number theory. A survey of
combinatorial theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo.,
1971) (1973), 117-138. PDF
Let $f(n)$ be maximal such that in any $A\subset \mathbb{Z}$ with $\lvert A\rvert=n$ there exists
some sum-free subset $B\subseteq A$ with $\lvert B\rvert \geq f(n)$, so that there are no
solutions to
$$a+b=c$$
with $a,b,c\in B$, allowing $a=b$. Estimate $f(n)$.
Since $f(n) = n/3 + o(n)$ is known, we interpret "estimate" as
determining the order of magnitude of the excess $f(n) - n/3$.
Alon and Kleitman [AlKl90, Proposition 1.1] improved the lower bound to $(n+1)/3$.
Here we restrict to sets of $n \geq 3$ positive integers, to match Bourgain's bound below.
Bourgain [Bo97, Proposition 1.3] further improved the lower bound to $(n+2)/3$
for sets of $n \geq 3$ positive integers. The size restriction appears in the proof on p. 76;
the set ${1,2}$ shows why it cannot be omitted.