Strong bounds for arithmetic progressions
CMSA Room G10 CMSA, 20 Garden Street, CambridgeColloquium 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. […]