What is largest size of set such that there is no square in the difference set?
That is we don’t want solutions to
Lower bounds:
(Rusza) There exists a set of size contained in
Proof: Rusza uses the following property: If there is a set such that its difference set modulo some number doesn’t have squares, then the difference set itself doesn’t have squares.
Lemma: Let be a squarefree integer. If is a square difference free set mod of then is a square difference free set.
If and , then we get , where is smallest index where and differ.
If is odd, dividing and the fact that is squarefree implies that . This cannot happen because the we get
If is even then divding by on both sides, we get
. If we go modulo , we get that , but are elements of the square difference set mod which is not possible.
The size of the set restricted to is
Therefore using which is difference free mod and , we get a set of size
(If we can find better examples of and , then we can improve these numerical results)
Upper Bounds:
The largest square difference free set has size at most
(Sarkozy) :
(Pintz, Steiger, and Szemeredi):
The proof of these results depends on Roth’s theorem type arguments using Fourier coefficients, density and energy increment arguments.
(See Wolf: Sets whose differences set is square-free, 2008)