Settling the Optimal Exponent Relating Sumsets and Difference Sets
arXiv:2607.27199
summary
The authors construct explicit finite subsets of the integers showing that the exponent 1/2 in the classical sum‑difference inequality cannot be improved, proving it is optimal.
Abstract
For a finite nonempty subset of an abelian group, let and . The classical sum-difference inequalities state that The exponent in the second inequality is known to be optimal, whereas it has remained open whether the exponent in the first inequality can be improved. We settle this question by constructing an explicit family of finite sets such that hence the exponent in the first inequality is also optimal. The construction and its proof were developed with the assistance of Hyra, an AI research agent based on the open-weights Hy3 model.
Topics & keywords
#additive combinatorics#sumsets#difference sets#extremal combinatorics#exponent optimalitysumsetdifference setsigma(A)delta(A)abelian groupAI‑assisted construction