Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Furstenberg-Sárközy theorem for sums of an even number of odd powers

Published 15 Sep 2026 in math.NT | (2609.16595v1)

Abstract: We obtain a Furstenberg-Sárközy-type result for sets A[N]A\subset [N] whose difference set AAA-A does not contain the sum of ss-many kk-th powers of positive integers, with $k&gt;1$ odd and $s&gt;0$ even. Namely, we prove that such sets must satisfy a power-saving bound AN<sup>11kmins</sup>σk,1/2+ε|A| \, \ll \, N<sup>{1-\frac1k\min{s</sup> \, σ_k, \, 1/2}+ε} for any fixed $ε&gt;0$, where $σ_k &gt;0 $ is any admissible saving in a classical one-variable Weyl estimate. In particular, we can take $σ_k=\max\left{2<sup>{1-k},</sup> \, \frac{1}{k(k-1)}\right}$ using the classical theory and the best currently available bounds for classical Weyl sums. A greedy construction produces a set A[N]A\subset[N] with AN<sup>1s/k|A|\gg N<sup>{1-s/k} for which AAA-A contains no sum of ss-many positive kk-th powers, so our power-saving bound is of the correct shape.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.