A Note on Elkin’s Improvement of Behrend’s Construction

@article{Green2010ANO,
  title={A Note on Elkin’s Improvement of Behrend’s Construction},
  author={B. Green and J. Wolf},
  journal={arXiv: Combinatorics},
  year={2010},
  pages={141-144}
}
  • B. Green, J. Wolf
  • Published 2010
  • Mathematics
  • arXiv: Combinatorics
  • We provide a short proof of a recent result of Elkin in which large subsets of \(\{1,\ldots,N\}\) free of three-term progressions are constructed. 
    Almost periodicity and its applications to Roth’s theorem
    On Roth's theorem on progressions
    134
    THE ERDŐS-MOSER SUM-FREE SET PROBLEM
    On certain other sets of integers
    35
    Improved bound in Roth's theorem on arithmetic progressions
    2
    An improved construction of progression-free sets
    • M. Elkin
    • Mathematics, Computer Science
    • 2010
    88
    Rainbow arithmetic progressions
    6
    On subsets of F1n containing no k-term progressions
    7

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    An improved construction of progression-free sets
    • M. Elkin
    • Mathematics, Computer Science
    • 2010
    88
    ON THE GROWTH OF A VAN DER WAERDEN-LIKE FUNCTION
    15
    An improved construction of progression-free sets
    31
    E-mail address: julia.wolf@cantab.net
      On Sets of Integers Which Contain No Three Terms in Arithmetical Progression.
      96
      Wilberforce Road, Cambridge CB3 0WA, Eng- land E-mail address: b.j.green@dpmms.cam.ac