OpenFrontiers
← Back to the index
OP-12144Status unassessedCombinatorics

Sum-difference problem III (AlphaEvolve problem 44)

Sum-difference problem III (AlphaEvolve problem 44). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository at commit 8f44745 (2026-07-11); the repository records AlphaEvolve results, not current research statusSource & evidence ↓

Problem statement

Let CC be the supremum of all constants such that there exist arbitrarily large finite sets of integers A,BA,B with ∣A+B∣≲∣A∣|A+B| \lesssim |A| and ∣A−B∣≳∣A∣C|A-B| \gtrsim |A|^{C}. Establish upper and lower bounds for CC that are as strong as possible.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Repository result category: former record — AlphaEvolve held the record, which has since been improved. See Section 6.25 in "Mathematical Exploration and Discovery at Scale " paper: arXiv:2511.02864. Experiment notebook.

Progress & source assessment

Improved constructions were subsequently obtained in "Sums and differences of sets (improvement over AlphaEvolve)" by Robert Gerbicz and in "Sums and differences of sets: a further improvement over AlphaEvolve" by Fan Zheng. by

References
  1. [1]Georgiev, Bogdan; Gómez-Serrano, Javier; Tao, Terence; Wagner, Adam Zsolt. Repository of problems accompanying “Mathematical exploration and discovery at scale” (arXiv:2511.02864), github.com/google-deepmind/alphaevolve_repository_of_problems (commit 8f44745, 11 July 2026). — Sum-difference problem III (AlphaEvolve problem 44) linkApache-2.0 (repository license); problem pages reproduced with attribution.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.