Combinatorics Seminar

Distance questions over prime fields

Yorgis Petridis, University of Georgia

Thursday, April 23rd, 2020
2:00 PM - 3:00 PM
Zoom ID: 797 681 224

Abstract: Let E be a subset of F_p^2. The Erdos-Falconer distance problem asks for lower bound on the number of distances determined by E. We present some recent progress both for “small” sets (with at most p elements) and for “large” sets (with at least p elements) for the pinned variant of this question. This result is joint work with Brendan Murphy, Thang Pham, Misha Rudnev, and Sophie Stevens.

Event contact: iosevich at gmail dot com