A General Incidence Bound in \mathbb R^d and Related Problems

2018/06/11 by Thao Do, Do, Thao, Adam Sheffer +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1806.04230

arxiv created 2018/09/12 · arxiv updated 2018/09/13

Abstract

We derive a general upper bound for the number of incidences with k-dimensional varieties in \mathbb R^d. The leading term of this new bound generalizes previous bounds for the special cases of k=1, k=d-1, and k= d/2, to every 1≤ k <d. We derive lower bounds showing that this leading term is tight in various cases. We derive a bound for incidences with transverse varieties, generalizing a result of Solymosi and Tao. Finally, we derive a bound for incidences with hyperplanes in \mathbb C^d, which is also tight in some cases. (In both \mathbb R^d and \mathbb C^d, the bounds are tight up to sub-polynomial factors.) To prove our incidence bounds, we define the dimension ratio of an incidence problem. This ratio provides an intuitive approach for deriving incidence bounds and isolating the main difficulties in each proof. We rely on the dimension ratio both in \mathbb R^d and in \mathbb C^d, and also in some of our lower bounds.

Related

• Incidences with curves in R^d
• Lower bounds for incidences with hypersurfaces
• Incidences between points on a variety and planes in R³
• Incidence bounds and applications over finite fields
• Incidence bounds via extremal graph theory