COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Erdős covering systems
Erdős covering systemsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. OOEW04 - Structure and Randomness - a celebration of the mathematics of Timothy Gowers Covering Systems (that is, finite collections of arithmetic progressions that cover the integers) were introduced by Paul Erdős over seventy years ago.The initial flow of results by Erdős, Davenport, Selfridge, Graham, and otherswas followed by a lull of activity for several decades. Although in the last twenty years several important results were proved, 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 the recent results obtained in several papers on the problems of Erdős and Selfridge; Schinzel; Filaseta, Ford, Konyagin Pomerance and Yu; and others.The results are joint with Balister, Morris, Sahasrabudhe and Tiba. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsLearning The new way After-ISIS: the future of Raqqa and Northern Syria Andrew Chamblin Memorial Lecture 2015Other talksSleep to forget unwanted memories Cambridge AI Club for Biomedicine - April 2024 Nigel Walker Lecture Debordering futures: racial capitalism, coloniality and migrant justice Active Surveillance of Neglected Tropical Diseases: A Fresh Push to Identify Reservoir Hosts Stability of continuous-time processes with jumps Part 1: Motivation, Models and Prerequisites |