A power saving for square-difference-free sets
There are absolute constants and such that, for every integer and every square-difference-free set , .
The proof of Theorem 1.1 on page 47 directly combines Lemma 4.2 and Theorem 9.2, both of which are rigorously established in the preceding sections.
“Theorem 1.1. There are absolute constants c > 0 and C < ∞ such that, for every integer N ≥ 1 and every square-difference-free set A ⊆ [N], |A| ≤ CN1−c.” · Show in paper