Speaker:  Jacob Fox (Stanford)

In-Person and Virtual

Zoom QR              https://harvard.zoom.us/j/779283357?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09

Code & Link:       Passcode: 657361

                              https://mathpicture.fas.harvard.edu/seminar

Title:                      Subset Sums

Abstract:              In this talk, I will discuss novel techniques which allow us to prove a diverse range of results on representing integers as subset sums,

including solutions to many long-standing open problems in the area. For example, we answer a question of Alon and Erdős on the minimum

number of colors needed to color the positive integers less than n so that n cannot be written as a monochromatic sum. Based on joint work with

David Conlon and Huy Tuan Pham. Time permitting, we will discuss some of the remaining outstanding open problems on subset sums and

connections to other areas of mathematics and computer science.