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: Tuesday, June 01, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: François Clément

Erdős-Falconer distance problem: distribution of distances in five dimensions

In this talk, I present a recent result on the Erdős-Falconer distance problem in five dimensions. More precisely, for a subset A of F_p, if the size of A is at least p^{13/22}, then all distances are determined by pairs of points in A^5. This improves previous results by Iosevich and Rudnev (2007), and Pham and Vinh (2020).


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