Gyarmati–Hennecart–Ruzsa sum–difference constant
Given finite integer sets X and Y, compare the set of sums with the set of differences . The Gyarmati–Hennecart–Ruzsa constant measures how large the difference set can be when the sumset stays at most K times the size of X, for every fixed 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
- 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.
Carson Olafson with ChatGPT Used different weighting parameters for sums and differences to prove in an exact finite construction.
AI contribution
Two-temperature cyclic compression for the Gyarmati-Hennecart-Ruzsa constant
Olafson proves for the Gyarmati–Hennecart–Ruzsa small-sumset exponent, using different weights for the sums and the differences and exact rational bounds.
Sources
Publication history
Two-temperature cyclic compression for the Gyarmati-Hennecart-Ruzsa constant
Daily emails by default, only when there’s an update.