By Zeev Dvir, Princeton University, Mathematics and Computer Science Departments, USA, email@example.com
We survey recent (and not so recent) results concerning arrangements of lines, points, and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we will discuss are:
Throughout the different parts of the survey, two types of techniques will make frequent appearance. One is the polynomial method, which uses polynomial interpolation to impose an algebraic structure on the problem at hand. The other recurrent techniques will come from the area of additive combinatorics.
The author is supported under NSF grant CCF-1217416.
Incidence theorems describe the way lines, points and other geometric objects intersect each other. Theorems of this sort have found a large number of exciting applications in the past few decades, both in mathematics and in theoretical computer science. Incidence Theorems and Their Applications presents some of the seminal results in this area as well as recent developments and applications. The presented results fall under three main themes. (i) Counting incidences: How many incidences can a set of lines have with a set of points? This basic question, and its generalizations, plays a role in proving various other theorems, some completely unrelated to geometry. (ii) Kakeya type problems: What is the 'best' way to arrange a set of lines, pointing in different directions, so that their overlap is maximized? Variations of this question appear in problems ranging from analysis and number theory to randomness extractors. (iii) Local to global problems: Suppose that, in a set of points, there are many small subsets that are dependent (for example, three points on a line). Can this information be used to give an upper bound on the dimension of the entire set? Problems of this kind are related to fascinating open problems in locally correctable error correcting codes. Incidence Theorems and Their Applications is aimed at both mathematicians and computer scientists and is suitable as a basis for a one semester course. Ideally, each chapter should be read from start to finish (the different chapters are mostly independent of each other).