I recently added to the incidence theory book
two chapters about incidences in
(Chapters 8 and 9). At the moment incidence bounds in
are known for several different cases, and it is rather unclear how a general incidence bound in
should look like. In this post I would like to state what I believe this bound should look like. This conjecture is in part a result of conversations with Joshua Zahl
over several years (I do not know whether Josh agrees with everything in this post). The post assumes some familiarity with incidence problems.
Joshua Zahl. A common name in this blog.
Let us start by stating some known bounds for incidences in
. The first general incidence bound that relied on polynomial techniques was by Solymosi and Tao
Theorem 1. Let be a set of points and let be a set of varieties, both in . The varieties of are of degree at most and dimension at most . The incidence graph of contains no copy of . Also, whenever two varieties are incident to a point , the tangent spaces of and at intersect at a single point. Then for any
While Theorem 1 provides a nice incidence bound, the varieties in it are somewhat restricted. A result of Fox et al.
holds for varieties of any dimension and without the restriction on the tangent spaces, at the cost of having a weaker bound.
Theorem 2. Let be a set of points and let be a set of varieties of degree at most , both in . Assume that the incidence graph of contains no copy of . Then for any
Finally, a result of Sharir et al.
provides a stronger bound for the special case of varieties of dimension one that do not cluster in a low degree surface (for brevity, the following is a simplified weaker variant).
Theorem 3. For every there exists a constant that satisfies the following. Let be a set of points and let be a set of irreducible varieties of dimension one and degree at most , both in . Assume that the incidence graph of contains no copy of , and that every variety of dimension two and degree at most contains at most elements of . Then
The incidence theory book describes in detail how to prove the three above bounds. With these result in mind, we are now ready to make a somewhat vague general conjecture.
Conjecture 4. Let be a set of points and let be a set of varieties of degree at most and dimension , both in . Assume that the incidence graph contains no copy of and that the varieties of satisfy some “reasonable conditions”. Then for any
For varieties of dimension smaller than
, the proof of Theorem 1 projects the configuration to a space of dimension that is twice the dimension of the varieties (forcing the dimension of the varieties to be exactly half the dimension of the space). This seems to be an inefficient step, which makes it likely that the theorem is not tight for varieties of dimension smaller than
. Indeed, Theorem 3 already obtains a stronger bound for the case of varieties of dimension one. For similar reasons, the proof of Theorem 2 seems not to be tight for varieties of dimension smaller than
A recent work
reduces the distinct distances problem in
to an incidence problem between points and
-dimensional planes in
. Combining this reduction with the bound stated in Conjecture 4 would lead to an asymptotically tight bound for the distinct distances problem in dimension
. Other problems also reduce to incidence problems with the same dimensions. Thus, the case of
) seems to be a main open case.
While conjecture 4 is known for the cases of varieties of dimension
, so far all of the other cases are open. The bound in the conjecture was not obtained by interpolating the three known cases — there is a better approach that leads to it. Recall that in the polynomial partitioning technique we partition
into cells, bound the number of incidences in each cell, and then bound the number of incidences that are on the partition (not in any cell). The bound stated in Conjecture 4 is obtained by applying this technique while ignoring the incidences on the partition (since bounding the number of incidences in the cells is much easier).
Recently discovered configurations
of points and varieties achieve the bound of the conjecture up to extra
‘s in the exponents. Thus, in its most general form the bound of the conjecture is tight. However, these constructions give a tight bound only for certain families of varieties of dimension
, for certain ranges of
, and when
. It seems plausible that the bound of the conjecture is not tight in some other interesting cases. In particular, in
a stronger bound
is already known when
, and it seems reasonable that the same technique would also work for varieties of dimension one in
. At the moment, it is difficult to guess what should happen with varieties of dimension larger than one. Either way, Conjecture 4 seems to be a reasonable bound for the limits of the current polynomial partitioning technique. It seems that this specific technique could not yield better bounds without major changes.
It is not clear what the “natural” restrictions are. For example, when studying incidences with two-dimensional planes in
most works rely on the transversality condition. In this case, the condition is equivalent to asking every two planes to intersect in at most one point. I recently noticed that the same incidence bound holds with a much weaker restriction of not too many planes in a hyperplane.
There is more to say about Conjecture 4, but this post is already getting longer than I intended.