For a finite nonempty subset A of an abelian group, write
σ(A):=∣A∣∣A+A∣,δ(A):=∣A∣∣A−A∣
for the doubling and difference constants. Ruzsa [Ru96] proved δ≤σ2, and the Plünnecke–Ruzsa inequalities give the converse σ≤δ2 [Bl26].
For ∣A∣≥2 with δ(A)>1, set C(A):=logσ(A)/logδ(A), and define
C3d:=AsupC(A)
over all such finite A; equivalently, C3d is the least exponent θ for which σ(A)≤δ(A)θ holds for every finite A. The Plünnecke–Ruzsa bound is exactly the assertion C3d≤2, and the question — open until 2026 — was whether σ≤δc is possible for some c<2.
Sums and differences are not interchangeable for a single set, so this is a genuinely one-sided question; the optimality of the exponent 2 in the companion inequality δ≤σ2 was already known (see below). The problem is now solved: C3d=2, by [LiLi26]. The value is approached but not attained by the known constructions.
The supremum is the same whether A ranges over finite subsets of Z or over finite subsets of arbitrary abelian groups, since a finite subset of an abelian group is Freiman-isomorphic to a subset of Z [Bl26].