Location of Repository

Finding Large 3-free Sets I: The Small n Case

By William Gasarch, James Glenn and Clyde P. Kruskal

Abstract

There has been much work on the following question: given n, how large can a subset of {1,..., n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch applications of large 3-free sets, present techniques to find large 3-free sets of {1,..., n} for n ≤ 250, and give empirical results obtained by coding up those techniques. In the sequel we survey the known techniques for finding large 3-free sets of {1,..., n} for large n, discuss variants of them, and give empirical results obtained by coding up those techniques and variants

Topics: Contents
Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.360.3837
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.