Green's Open Problem 25: Upper
We conjecture that the best-known upper bound can be lowered.
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.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].
It is not known whether, if is an abelian group of size , there always exists a Sidon subset of of size [Gr24].
Another very nice old problem is whether there is a Sidon subset of of size , where [Gr24].
Let be a prime and let be a set of size . Is there a dilate of containing a gap of length ?
Even what happens in the regime is unclear [Gr24].
Are there infinitely many for which there is a set , , with ? [Gr24]
Do the following exist, for arbitrarily large ? An abelian group with , together with subsets satisfying and , such that the sets are disjoint from the sets ()?
NOTE: according to [CKS05, 4.1], the conditions should be disjoint from for
. See green_36.variants.cks05.
Variant using the exact simultaneous double product property from [CKS05, 4.1].
Given a natural number N, what is the smallest size of a subset of ℕ that contains, for each d = 1, …, N,
an arithmetic progression of length k with common difference d.
Asymptotic version: determine the asymptotic behavior of m(N, k) as N grows.
The solver should determine what function f : ℕ → ℝ eventually equals (fun N ↦ (m N k : ℝ)).