University of Cambridge > Talks.cam > Discrete Analysis Seminar > On the structure of infinite sumsets in the integers

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

On the structure of infinite sumsets in the integers

Download to your calendar using vCal

  • UserFlorian Richter (EPFL)
  • ClockWednesday 18 March 2026, 13:30-14:30
  • HouseMR4, CMS.

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 lists

Average on Saturdays: 7502.11340206 kWh Average on weekdays: 9040.23466258 kWh MR14, Centre for Mathematical Sciences

Other talks

Group Presentation 2 An AI-Assisted Proof in Spectral Geometry Group Presentation 3  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response  Title to be confirmed Nature and law
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity