Green's Open Problem 36

Do the following exist, for arbitrarily large n? An abelian group H with |H| = n^2+o(1), together with subsets A_1, ..., A_n, B_1, ..., B_n satisfying |A_i||B_i| ≥ n^2-o(1) and |A_i + B_i| = |A_i||B_i|, such that the sets A_i + B_i are disjoint from the sets A_j + B_k (j ≠ k)?

Current state (tracked automatically)

Formal Conjectures marks the Lean statement green_36 as open.

All tracked facts and sources

Fact	Value	Source
Formal Conjectures: status of `green_36`	research open	Formal Conjectures
Formal Conjectures: research statements in the file	2 open, 0 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-green-36,
  title        = {Green's Open Problem 36},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/green-36}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fgreen-36.json)](https://cairn-commons.com/problems/green-36)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

Do the following exist, for arbitrarily large $n$ ? An abelian group $H$ with $∣ H ∣ = n^{2 + o (1)}$ , together with subsets $A_{1}, ..., A_{n}, B_{1}, ..., B_{n}$ satisfying $∣ A_{i} ∣∣ B_{i} ∣ \geq n^{2 - o (1)}$ and $∣ A_{i} + B_{i} ∣ = ∣ A_{i} ∣∣ B_{i} ∣$ , such that the sets $A_{i} + B_{i}$ are disjoint from the sets $A_{j} + B_{k}$ ( $j \neq = k$ )?

NOTE: according to [CKS05, 4.1], the conditions should be $A_{i} + B_{j}$ disjoint from $A_{j} + B_{k}$ for $i \neq = k$ . See green_36.variants.cks05.

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.GreensOpenProblems.«36».

theorem green_36 :
    ∀ ε > (0 : ℝ), ∃ᶠ n in atTop,
      ∃ (H : Type) (_ : AddCommGroup H) (_ : Finite H) (A B : Fin n → Finset H),
        (n : ℝ) ^ (2 - ε) ≤ Nat.card H ∧ Nat.card H ≤ (n : ℝ) ^ (2 + ε) ∧
        (∀ i, (n : ℝ) ^ (2 - ε) ≤ (A i).card * (B i).card) ∧
        Green36Property A B

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

Variants

green_36.variants.cks05 — Variant using the exact simultaneous double product property from [CKS05, 4.1].

References

[Gr24] Green's Open Problems #36
[CKS05] Cohn, H., Kleinberg, R., Szegedy, B., and Umans, C. "Group-theoretic Algorithms for Matrix Multiplication" (Problem 4.7)

Source and licence

Imported from Formal Conjectures (Ben Green's 100 open problems), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.