Indexed metadata

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

Alexandros Kalogirou, Andrew Lott, Ákos Magyar, Akash Singha Roy

Source record

Source: arXiv

Published: Sep 15, 2026

arXiv: 2609.16595

Open original source ↗

Source 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>1k>1 odd and s>0s>0 even. Namely, we prove that such sets must satisfy a power-saving bound AN11kmin{sσk,1/2}+ε|A| \, \ll \, N^{1-\frac1k\min\{s \, σ_k, \, 1/2\}+ε} for any fixed ε>0ε>0, where σk>0σ_k >0 is any admissible saving in a classical one-variable Weyl estimate. In particular, we can take σk=max{21k,1k(k1)}σ_k=\max\left\{2^{1-k}, \, \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 AN1s/k|A|\gg N^{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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.