Ben Green's Open Problem 16
.
Questions, not proof records
Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.
sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore..
From [Yufei Zhao]: Is there a subset of of size with no nontrivial solutions to ?
Suppose that is a finite group, and let be a subset of density . Is it true that there are triples such that all lie in ?
Note: A is taken as -dense, i.e. [Au16, Question 2]
[Ma21] showed that .
[Ma21] showed that .
If is -coloured then, for , there are integers such that have the same colour.
Find reasonable bounds for . The goal is to improve upon the Green-Sawhney bound.
If is a set of integers, what is the maximum number of affine translates of the set that can contain?
Conjectured in [Aa19] p.579: .
Conjecture p.579 in [Aa19]: .
For which values of is the following true: whenever we partition , ?
We conjecture that the best-known upper bound can be lowered.
We conjecture that the best-known lower bound can be raised.
The analogous problem in remains open. [Gr24]
What is the size of the smallest set (with at least two elements) for which no element in the sumset has a unique representation?
Propose a better lower bound along primes.
Propose a better upper bound along primes.
Can we improve the lower bound , at least for infinitely many ?
Can we improve the lower bound , for all sufficiently large ?
Can we improve the upper bound [CHO25], at least for infinitely many ?
Can we improve the upper bound [CHO25], for all sufficiently large ?
It is not known whether or not there exists a Sidon subset of of size , for all [Gr24].