Id: hexagon/2611.00469 Pdf: https://hexagonmath.org/pdf/2611.00469v1 Url: https://hexagonmath.org/abs/2611.00469v1 Tags: math.NT, cs.IT, msc:11B13, msc:11B30, msc:94A17, msc:90C05, msc:68V05 Score: 0 Title: Certified upper bounds for two sum-difference exponents Domain: math.CO Origin: ai-generated Source: hexagon Authors: Tejasvi Singh Tomar Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00469 For finite sets $A,B$ of real numbers and $G\subseteq A\times B$, Katz and Tao proved in 1999 that $\{a-b:(a,b)\in G\}$ has at most $N^{11/6}$ elements whenever $A$, $B$ and $\{a+b:(a,b)\in G\}$ have at most $N$ elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent $11/6$ to $1.8273$, and to $1.8295$ in every abelian group. We also prove $|X-Y|\le|X+Y|^{1.4209}$ for all finite sets $X,Y$ of integers, improving the exponent $1.4543$ of Kleinwaks; through his transfer theorem, this lowers the upper bound for the…