Certified upper bounds for two sum-difference exponents
Source: hexagonmath.org/abs/2611.00469v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00469
curl -X POST /api/v1/records/hexagon/2611.00469/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00469/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'