Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
All topics

108 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 31: Abelian

It is not known whether, if GG is an abelian group of size nn, there always exists a Sidon subset of GG of size 0.01n0.01\sqrt{n} [Gr24].

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 31: Sidon 01n

Another very nice old problem is whether there is a Sidon subset of {0,1}n\{0, 1\}^n of size N0.51N^{0.51}, where N=2nN = 2^n [Gr24].

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 32

Let pp be a prime and let AZ/pZA \subset \mathbb{Z}/p\mathbb{Z} be a set of size p\lfloor \sqrt{p} \rfloor. Is there a dilate of AA containing a gap of length 100p100\sqrt{p}?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 32: Log Regime

Even what happens in the regime ω(p)10logp\omega(p) \sim 10 \log p is unclear [Gr24].

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 33

Are there infinitely many qq for which there is a set AZ/qZA \subset \mathbb{Z}/q\mathbb{Z}, A=(2+o(1))q1/2|A| = (\sqrt{2} + o(1))q^{1/2}, with A+A=Z/qZA + A = \mathbb{Z}/q\mathbb{Z}? [Gr24]

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 36

Do the following exist, for arbitrarily large nn? An abelian group HH with H=n2+o(1)|H| = n^{2+o(1)}, together with subsets A1,...,An,B1,...,BnA_1, ..., A_n, B_1, ..., B_n satisfying AiBin2o(1)|A_i||B_i| \ge n^{2-o(1)} and Ai+Bi=AiBi|A_i + B_i| = |A_i||B_i|, such that the sets Ai+BiA_i + B_i are disjoint from the sets Aj+BkA_j + B_k (jkj \neq k)?

NOTE: according to [CKS05, 4.1], the conditions should be Ai+BjA_i + B_j disjoint from Aj+BkA_j + B_k for iki \neq k. See green_36.variants.cks05.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 36: Cks05

Variant using the exact simultaneous double product property from [CKS05, 4.1].

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 37

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.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 37

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 : ℝ)).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 37

Determine the asymptotic equivalence class (theta) of m(N, k).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 37

Determine an upper bound (big O) for m(N, k).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 37

Determine a strict upper bound (little o) for m(N, k).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 38: Lower

Can we improve the lower bound?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 38: Upper

Can we improve the best upper bound?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 39

If AZ/pZA \subset \mathbb{Z}/p\mathbb{Z} is random, A=p|A| = \sqrt{p}, can we almost surely cover Z/pZ\mathbb{Z}/p\mathbb{Z} with 100p100\sqrt{p} translates of AA? [Gr24]

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 39: Variant 101

"I do not know how to answer this even with 100 replaced by 1.01." [Gr24]"

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 39: Variant Theta

Similar questions are interesting with p\sqrt{p} replaced by pθp^\theta for any θ1/2\theta \le 1/2. [Gr24]

NOTE: using CpθC p^\theta translates as stated makes the conjecture trivially false by the pigeonhole principle. Indeed for a set of size pθp^\theta, we cover at most Cp2θC p^{2\theta} elements, which is strictly less than pp for θ<1/2\theta < 1/2. We interpret the question as asking whether O(p1θ)O(p^{1-\theta}) translates suffice. This generalizes the main conjecture where p=p11/2\sqrt{p} = p^{1-1/2}.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 40

Does f(r)f(r) \to \infty? [Gr24]

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openGreen's Open Problems · Combinatorics

Ben Green's Open Problem 40: F Eq One For All

The possibility that f(r) = 1 for all r has not been ruled out [Gr24]

Source checked Jul 26, 20261 pinned Lean statementInspect problem