- Series
- Analysis Seminar
- Time
- Wednesday, April 12, 2017 - 2:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Eyvi Palsson – Virginia Tech
- Organizer
- Shahaf Nitzan
Finding and understanding patterns in data sets is of significant
importance in many applications. One example of a simple pattern is the
distance between data points, which can be thought of as a 2-point
configuration. Two classic questions, the Erdos distinct
distance problem, which asks about the least number of distinct
distances determined by N points in the plane, and its continuous
analog, the Falconer distance problem, explore that simple pattern.
Questions similar to the Erdos distinct distance problem and
the Falconer distance problem can also be posed for more complicated
patterns such as triangles, which can be viewed as 3-point
configurations. In this talk I will present recent progress on Falconer
type problems for simplices. The main techniques used come
from analysis and geometric measure theory.