Steven Senger, Missouri State University
1:30 PM - 2:30 PM
The classical Erdos distinct distances problem asks how many distinct distances must be present in a large finite set of points in the plane. One variant of this problem that has attracted some attention over the past decade is the same problem posed for dot products. We discuss recent advances on this problem stemming from the study of the additive combinatorics of convex sets of numbers, which are sets of numbers with increasing gaps between successive elements.
Event contact: iosevich at gmail dot com