Lab Report · Number Theory

Split primes and the Elekes–Rónyai problem

arXiv:2606.13619v1 · Cosmin Pohoata · Number Theory / Combinatorics

This report contextualizes next steps and recent work on additive combinatorics and prime numbers.

Overview

Announcement tweet + AI: The paper studies whether the prime numbers can be partitioned into two large subsets whose pairwise sums avoid certain additive coincidences. The work extends questions related to the Elekes–Rónyai problem into the setting of primes, blending ideas from additive combinatorics, sieve methods, and analytic number theory.

Infographic Summary

Infographic lab report for arXiv 2606.13619, Split primes and the Elekes–Rónyai problem, showing scientific context, modular perspective, engineering statement, artifacts, and next steps.
In general: climate reality contextualizes scientific intent; where engineering statements specify next 2 = 1 + 1 steps.

Engineering Statement

Intent

Agents investigate whether primes can be partitioned into large subsets avoiding nontrivial additive solutions.

Evidence

Explicit constructions and asymptotic bounds derived from techniques in additive combinatorics and sieve theory.

Outputs

Mathematical statements, proofs, future questions, and opportunities for explanatory artifacts.

Climate Reality: The Premise of Context

Prime numbers have been studied across centuries and cultures. Contemporary papers extend that shared work through new methods, examples, proofs, and conjectures.

Concepts such as modular arithmetic provide contexts that constrain what kinds of numerical structures are possible. For example, mod30 residue classes remain useful contexts for understanding where primes greater than five can occur, even when the primary focus of this paper lies elsewhere.

How this paper addresses the Elekes–Rónyai problem

The Elekes–Rónyai problem asks how large the image set f(A,B) must be for finite sets A and B. Earlier work showed that if a polynomial repeatedly produces unusually small image sets, it typically has a special additive or multiplicative structure.

This paper constructs a polynomial that is non-special while still producing unexpectedly small image sets on arbitrarily large finite sets. The mechanism relies on split primes, local residue restrictions, and the Chinese remainder theorem to constrain the polynomial's values.

In this way, the paper provides a counterexample to a conjectured near-quadratic growth principle for non-special polynomials. The result expands the known landscape of how arithmetic structure can influence combinatorial behavior.

The companion notebook translates these ideas into reproducible next steps. It generates an Engineering Statement, introduces the paper's vocabulary, explores toy examples of image sets and modular residue constraints, and demonstrates how local restrictions can shape global behavior.

Rather than reproducing the full proof, the notebook supports comprehension and future extension. It serves as a bridge between the original paper and subsequent Number Theory reports.

Run the companion notebook →

Explore Further · Next Steps

🧠 Continue learning

  • Review additive combinatorics.
  • Explore related Number Theory reports.
  • Investigate future papers extending this work.

🤝 Participate locally

  • Discuss the ideas with others.
  • Share explanatory artifacts.