Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, September 24, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Thang Pham

Falconer Distance Conjecture: Continuous and Discrete

In this talk, we present the recent progress on the Erdos-Falconer distance conjecture in positive characteristic. More precisely, we will show that for any set E in $\mathbb{F}_p^2$, if $|E|\ge p^{5/4}$, then $E$ determines a positive proportion of all possible distances. This is the finite field analogue of a recent breakthrough paper on the Falconer distance conjecture due to Guth, Iosevich, Ou, Wang (2019). This is joint work with Brendan Murphy, Giorgis Petridis, Misha Rudnev and Sophie Stevens.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login