Gyarmati–Hennecart–Ruzsa sum–difference constant

Given finite integer sets X and Y, compare the set of sums X+YX+Y with the set of differences X−YX-Y. The Gyarmati–Hennecart–Ruzsa constant C3aC_{3a} measures how large the difference set can be when the sumset stays at most K times the size of X, for every fixed K>1K>1 and arbitrarily large X.

Why it matters and what counts as progress

Why it matters: The exponent describes an asymmetry between addition and subtraction even when addition produces relatively few distinct values.

What counts as progress: Raise the lower bound by constructing sets with more differences for the same sumset constraint, or lower the upper bound for all admissible sets. Preserve the quantifiers on K and the size of X.

How the problem developed

  1. 2008 · Small-sumset framework [1]

    Katalin Gyarmati, François Hennecart and Imre Z. Ruzsa Studied the size of differences under the small-sumset condition and established bounds and a finite-set construction principle.

  2. 29 Oct 2026 · Improved lower bound [2][3]

    Carson Olafson with ChatGPT Used different weighting parameters for sums and differences to prove C3a>60709/50000C_{3a}>60709/50000 in an exact finite construction.

AI contribution

Sources

  1. Sums and differences of finite sets
  2. Two-temperature cyclic compression for the Gyarmati-Hennecart-Ruzsa constant
  3. Exact checked statement and attribution
Publication history