{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-15","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}