An Upper Bound Exponent of 0.9999873 for Square-Difference-Free Sets
Source: hexagonmath.org/abs/2611.00293v1
Let $A\subseteq\{1,\ldots,N\}$ contain no two distinct elements whose difference is a nonzero square, and let $s(N)$ be the largest possible size of such a set. We prove \[ s(N)\le CN^{0.9999873} \] with an absolute constant $C$. A recent preprint of OpenAI proves $s(N)\le CN^{1-\eps}$ for some absolute $\eps>0$. Their proof utilizes a certain average of the Fourier transform over $(24!)^{161}$ points, and for the parameter choices displayed there we calculate that they obtained $\eps\approx \exp_{10}(-\exp_{10}(\exp_{10}(5782.77)))$, in the sense that…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00293
curl -X POST /api/v1/records/hexagon/2611.00293/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00293/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'