Furstenberg–Sárközy theorem

Furstenberg–Sárközy theorem


The Furstenberg–Sárközy theorem is a result in additive number theory on square-difference-free sets, named after Hillel Furstenberg and András Sárközy. It states that, if is a set of natural numbers with the property that no two numbers in differ by a square number, then the natural density of is zero. That is, for every , and for all sufficiently large , the fraction of the numbers up to that are in is less than . Equivalently, every set of natural numbers with positive upper density contains two numbers whose difference is a square.[1]


An example of a set with no square differences arises in the game of subtract a square, invented by Richard A. Epstein and first described by Solomon W. Golomb. In this game, two players take turns removing coins from a pile of coins, with the goal being to be the person who removes the last coin. In each turn, either player can only remove a square number of coins from the pile.[2]

Any position in this game can be described by an integer, its number of coins. The non-negative integers can be partitioned into "cold" positions, in which the player who is about to move is losing, and "hot" positions, in which the player who is about to move can win by moving to a cold position. No two cold positions can differ by a square, because if they did then a player faced with the larger of the two positions could move to the smaller position and win. Thus, the cold positions form a set with no square difference:

0, 2, 5, 7, 10, 12, 15, 17, 20, 22, 34, 39, 44, … (sequence A030193 in the OEIS)

These positions can be generated by a greedy algorithm in which the cold positions are generated in numerical order, at each step selecting the smallest number that does not have a square difference with any previously selected number.[2][3] As Golomb observed, the cold positions are infinite, and more strongly the number of cold positions up to is at least proportional to . For, if there were fewer cold positions, there wouldn't be enough of them to supply a winning move to each hot position.[2] The Furstenberg–Sárközy theorem shows, however, that the cold positions are less frequent than hot positions: for every , and for all large enough , the proportion of cold positions up to is at most . That is, when faced with a starting position in the range from 1 to , the first player can win from most of these positions.[4]

Upper bounds

The Furstenberg–Sárközy theorem was conjectured by László Lovász, and proved independently in the late 1970s by Hillel Furstenberg and András Sárközy, after whom it is named.[5][6] Since their work, several other proofs of the same result have been published, generally either simplifying the previous proofs or strengthening the bounds on how sparse a square-difference-free set must be.[7][8][9] In particular, it is now known that a square-difference-free set can include at most

of the integers from to .[10]

Most of these proofs use Fourier analysis or ergodic theory. However, this is not necessary for a proof of the basic form of the theorem, that every square-difference-free set has zero density.[9]

Lower bounds

Paul Erdős conjectured that every square-difference-free set has

elements up to , for some constant , but this was disproved by Sárközy, who proved that denser sequences exist. In turn, Sárközy weakened Erdős's conjecture to state that, for every , every square-difference-free set has

elements up to .[11] This, in turn, was disproved by Imre Z. Ruzsa, who found square-difference-free sets with up to


Ruzsa's construction chooses a square-free integer as the radix of the base- notation for the integers, such that there exists a large set of numbers from to none of whose difference are squares modulo . He then chooses his square-difference-free set to be the numbers that, in base- notation, have members of in their even digit positions. The digits in odd positions of these numbers can be arbitrary. Ruzsa found the seven-element set modulo , giving the stated bound. Subsequently Ruzsa's construction has been improved by using a different base, , to give square-difference-free sets with size


When applied to the base , the same construction generates the Moser–de Bruijn sequence multiplied by two, a square-difference-free set that is too sparse to provide nontrivial lower bounds on the Furstenberg–Sárközy theorem but one that has other notable mathematical properties.[15]

Unsolved problem in mathematics:
Is there an exponent such that every square-difference-free subset of has elements?
(more unsolved problems in mathematics)

Based on these results, it has been conjectured that for every and every sufficiently large there exist square-difference-free subsets of the numbers from to with elements. That is, if this conjecture is true, the exponent of one in the upper bounds for the Furstenberg–Sárközy theorem cannot be lowered.[8] As an alternative possibility, the exponent 3/4 has been identified as "a natural limitation to Ruzsa's construction" and another candidate for the true maximum growth rate of these sets.[16]


  1. ^ Eisner, Tanja; Farkas, Bálint; Haase, Markus; Nagel, Rainer (2015), "20.5 The Furstenberg–Sárközy Theorem", Operator Theoretic Aspects of Ergodic Theory, Graduate Texts in Mathematics, 272, Cham, Switzerland: Springer, pp. 455–457, doi:10.1007/978-3-319-16898-2, ISBN 978-3-319-16897-5, MR 3410920 .
  2. ^ a b c Golomb, Solomon W. (1966), "A mathematical investigation of games of "take-away"", Journal of Combinatorial Theory, 1 (4): 443–458, doi:10.1016/S0021-9800(66)80016-9, MR 0209015 .
  3. ^ "Sloane's A030193". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. 
  4. ^ The applicability of this theorem to the sequence produced by the greedy algorithm is implicit in Ruzsa (1984), who begins his paper with the statement that, "obviously", the greedy sequence must have size at least proportional to the square root. Lyall & Rice (2015) state that a construction of Ruzsa (1984) generates sets "much larger than the set yielded by the greedy algorithm", but do not provide bounds or citations that detail the size of the greedy set.
  5. ^ Furstenberg, Harry (1977), "Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions", Journal d'Analyse Mathématique, 31: 204–256, doi:10.1007/BF02813304, MR 0498471 .
  6. ^ Sárkőzy, A. (1978), "On difference sets of sequences of integers. I" (PDF), Acta Mathematica Academiae Scientiarum Hungaricae, 31 (1–2): 125–149, doi:10.1007/BF01896079, MR 0466059 .
  7. ^ Green, Ben (2002), "On arithmetic structures in dense sets of integers", Duke Mathematical Journal, 114 (2): 215–238, doi:10.1215/S0012-7094-02-11422-7, MR 1920188 .
  8. ^ a b Lyall, Neil (2013), "A new proof of Sárközy's theorem", Proceedings of the American Mathematical Society, 141 (7): 2253–2264, arXiv:1107.0243, doi:10.1090/S0002-9939-2013-11628-X, MR 3043007 .
  9. ^ a b Tao, Terry (February 28, 2013), "A Fourier-free proof of the Furstenberg-Sarkozy theorem", What's new 
  10. ^ Pintz, János; Steiger, W. L.; Szemerédi, Endre (1988), "On sets of natural numbers whose difference set contains no squares", Journal of the London Mathematical Society, Second Series, 37 (2): 219–231, doi:10.1112/jlms/s2-37.2.219, MR 928519 .
  11. ^ Sárközy, A. (1978), "On difference sets of sequences of integers. II", Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae, 21: 45–53 (1979), MR 536201 .
  12. ^ Ruzsa, I. Z. (1984), "Difference sets without squares", Periodica Mathematica Hungarica, 15 (3): 205–209, doi:10.1007/BF02454169, MR 756185 .
  13. ^ Beigel, Richard; Gasarch, William (2008), Square-difference-free sets of size , arXiv:0804.4892 .
  14. ^ Lewko, Mark (2015), "An improved lower bound related to the Furstenberg-Sárközy theorem", Electronic Journal of Combinatorics, 22 (1): Paper 1.32, 6, MR 3315474 .
  15. ^ "Sloane's A000695 : Moser-de Bruijn sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. 
  16. ^ Lyall, Neil; Rice, Alex (2015), Difference sets and polynomials, arXiv:1504.04904 .

Related Blogs

  • Did not find any related blogs!
Loading ...