Up: Student Seminars for 2004
Top: Math Department Student Seminars

Finding Large Sets Without Arithmetic Progressions of Length Three

by

William Gasarch
University of Maryland

January 8, 2004
4:30 pm
Bailey Hall 201


Abstract:

What is the largest subset of {1,2,3,...,100000} that does not have ANY arithmetic progressions of length three? (That is, it cannot have 11, 13, 15, or 30, 35, 40, or any set of three numbers that are equally spaced.)

There is a large literature on the problem of what is the largest subset of {1,2,...,n}, but the results are asymptotic---they hold only when n is large.

We have combined the literature with computer experiments to find large subsets of {1,2,...,n} for reasonably sized n.

In this talk we will review the literature, say how we had to modify it for our purposes, and present empirical results.

(William Gasarch will also give a talk in the Computer Science Department. Check out http://cs.union.edu/seminar/gasarch.html for details.)


For additional information, send e-mail to math@union.edu or call (518) 388-6246.
Up: Student Seminars for 2004
Top: Math Department Student Seminars

[HOME]
Union College Math Department Home Page
Comments to: math@union.edu
Created automatically on: Sun Jul 15 19:01:10 EDT 2018