BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Erdős covering systems - Bela Bollobas (University of Cambridge)
DTSTART:20240408T103000Z
DTEND:20240408T113000Z
UID:TALK213853@talks.cam.ac.uk
DESCRIPTION:Covering Systems (that is\, finite collections of arithmetic p
 rogressions that cover the integers) were introduced by Paul Erdős over s
 eventy years ago.The initial flow of results by Erdős\, Davenport\, Selfr
 idge\, Graham\, and otherswas followed by a lull of activity for several d
 ecades. Although in the last twenty years several important results were p
 roved\, many old questions have remained open. In the talk I shall survey 
 a number of the early results about covering systems\, and then turn to th
 e recent results obtained in several papers on the problems of Erdős and 
 Selfridge\; Schinzel\; Filaseta\, Ford\, Konyagin Pomerance and Yu\; and o
 thers.The results are joint with Balister\, Morris\, Sahasrabudhe and Tiba
 .
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR