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.
1 topic

373 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openGreen's Open Problems · Combinatorics

Green's Open Problem 24

Conjecture p.579 in [Aa19]: (13+o(1))n2\left({1}{3} + o(1)\right) n^2.

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

Green's Open Problem 25

For which values of kk is the following true: whenever we partition [N]=A1Ak[N] = A_1 \cup \dots \cup A_k, i=1k(Ai+^Ai)110N\left|\bigcup^k_{i=1} (A_i \hat{+} A_i)\right| \geq \frac{1}{10} N?

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

Green's Open Problem 25: Upper

We conjecture that the best-known upper bound can be lowered.

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

Green's Open Problem 25: Lower

We conjecture that the best-known lower bound can be raised.

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

Green's Open Problem 26

The analogous problem in Fpn\mathbb{F}^n_p remains open. [Gr24]

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

Green's Open Problem 27: Equivalent

What is the size of the smallest set AZ/pZA \subset \mathbb{Z} / p\mathbb{Z} (with at least two elements) for which no element in the sumset A+AA + A has a unique representation?

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

Green's Open Problem 27: Lower

Propose a better lower bound along primes.

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

Green's Open Problem 27: Upper

Propose a better upper bound along primes.

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

Ben Green's Open Problem 31: Lower

Can we improve the lower bound N1/2+O(1)N^{1/2} + O(1), at least for infinitely many NN?

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

Ben Green's Open Problem 31: Lower Eventually

Can we improve the lower bound N1/2+O(1)N^{1/2} + O(1), for all sufficiently large NN?

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

Ben Green's Open Problem 31: Upper

Can we improve the upper bound N1/2+0.98183N1/4+O(1)N^{1/2} + 0.98183 N^{1/4} + O(1) [CHO25], at least for infinitely many NN?

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

Ben Green's Open Problem 31: Upper Eventually

Can we improve the upper bound N1/2+0.98183N1/4+O(1)N^{1/2} + 0.98183 N^{1/4} + O(1) [CHO25], for all sufficiently large NN?

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

Ben Green's Open Problem 31: Zmod P

It is not known whether or not there exists a Sidon subset of Z/pZ\mathbb{Z}/p\mathbb{Z} of size (1+o(1))p(1 + o(1))\sqrt{p}, for all pp [Gr24].

Source checked Jul 26, 20261 pinned Lean statementInspect problem
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