Strong bounds for arithmetic progressions
CMSA Room G10 CMSA, 20 Garden Street, Cambridge, MA, United StatesColloquium Speaker: Raghu Meka (UCLA) Title: Strong bounds for arithmetic progressions Abstract: Suppose you have a set S of integers from {1,2,...,N} that contains at least N / C elements. Then for large enough N, must S contain three equally spaced numbers (i.e., a 3-term arithmetic progression)? In 1953, Roth showed this is the case […]