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 16

f(N)Nec(logN)1/7f(N) \gg N \cdot e^{-c(\log N)^{1/7}}.

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

Ben Green's Open Problem 16

From [Yufei Zhao]: Is there a subset of {1,,N}\{1, \ldots, N\} of size N1/3o(1)N^{1/3 - o(1)} with no nontrivial solutions to x+2y+3z=x+2y+3zx + 2y + 3z = x' + 2y' + 3z'?

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

Ben Green's Open Problem 18

Suppose that GG is a finite group, and let AG×GA \subset G \times G be a subset of density α\alpha. Is it true that there are αG3\gg_\alpha |G|^3 triples x,y,gx, y, g such that (x,y),(gx,y),(x,gy)(x, y), (gx, y), (x, gy) all lie in AA?

Note: A is taken as α\alpha-dense, i.e. AαG2|A| \ge \alpha |G|^2 [Au16, Question 2]

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

Ben Green's Open Problem 19: Lower

[Ma21] showed that 3.13C3.13 \leq C.

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

Ben Green's Open Problem 19: Upper

[Ma21] showed that C4C \leq 4.

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

Green's Open Problem 22

If {1,,N}\{1, \ldots, N\} is rr-coloured then, for NN0(r)N \geqslant N_0(r), there are integers x,y3x, y \geqslant 3 such that x+y,xyx + y, xy have the same colour.

Find reasonable bounds for N0(r)N_0(r). The goal is to improve upon the Green-Sawhney bound.

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

Green's Open Problem 24

If AA is a set of nn integers, what is the maximum number of affine translates of the set {0,1,3}\lbrace 0,1,3 \rbrace that AA can contain?

Conjectured in [Aa19] p.579: (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 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