![]() |
University of Cambridge > Talks.cam > Discrete Analysis Seminar > On the structure of infinite sumsets in the integers
On the structure of infinite sumsets in the integersAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Julia Wolf. A long-standing problem in combinatorial number theory, posed by Erdős and Graham, asks for a classification of all integer subsets A and B for which d(A+B)=d(A)+d(B), where d(.) denotes the natural density in the integers. We will discuss the history and motivation of this problem, its connections to ergodic theory, as well as recent progress toward its resolution. This talk is based on joint work with Ethan Ackelsberg. This talk is part of the Discrete Analysis Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCubo Lennard-Jones Lecture 2017 CISA Panel on 2013 Italian ElectionsOther talksComputational Biology: Seminar Series - Jonathan Frazer Quantum unique ergodicity for magnetic Laplacians on the torus Inverse localization properties of high-energy eigenfunctions of the Laplacian Panel - Next Steps from Themes of the Day Introduction to the Challenges and OUTPLACE Interdisciplinary youth mental health research: bullying, phenomenology, and epistemic justice. |