most recent 30 from http://mathoverflow.net 2013-05-20T09:07:39Z http://mathoverflow.net/feeds/question/80085 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/80085/small-maximal-sets-with-no-3-ap Mike 2011-11-04T21:03:49Z 2011-11-04T21:03:49Z

<p>Everyone knows about the problem of finding the largest set in 1,2,...,N which contains no arithmetic progression of length 3.....what happens if we look at the set which is the smallest maximal subset of 1,...,N which contains no 3-AP?</p> <p>Obviously we have a square root lower bound using a greedy argument and a simple upper bound, with exponent log(2)/log(3), by looking at integers with no 2 in their base 3 representation. Is anything better known, in either direction? I know about the original work of Stanley and Odlyzko.......</p>