Department of Mathematical Sciences
Events
People
Colloquia and Seminars
Conferences
Centers
Positions
Areas of Research
About the Department
Alumni |
Algorithms, Combinatorics and Optimization Seminar
UCLA Title: Efficient partitioning of Euclidean space and incidence theorems Abstract: The polynomial partitioning theorem of Guth and Katz has led to many new bounds on the number of incidences between points and various types of geometric objects such as lines, planes, spheres, etc. The general paradigm is as follows. Simple geometric considerations give crude bounds on the number of incidences between points and various types of geometric objects. These bounds can then be strengthened by partitioning Euclidean space into disjoint "cells," applying the crude bound within each cell, and then summing the resulting contributions. I will discuss these techniques, some recent results, and some open problems in this field. Date: Thursday, October 11, 2012 Time: 3:30 pm Location: Wean Hall 8220 Submitted by: Loh |