We continue to survey the known lower bounds for incidence problems (the previous post in this series can be found here). After a couple of posts in we now return to , to introduce a new technique that I recently learned about. This technique was discovered by Jozsef Solymosi, and is described in a work of Solymosi and Endre Szabó that is unpublished at this point. As seems to often be the case with results of Solymosi, it is quite simple and elegent. In this technique yields bounds that can also be obtained from Elekes’ technique (discussed in a previous post), but in higher dimensions it leads to new bounds that are also tight (which would hopefully discuss in a future post). I would like to thank Jozsef Solymosi for allowing me to describe his technique in this blog, and to Frank de Zeeuw for discussions that led to this post.
To introduce the technique, we first consider the case of axis-parallel parabolas. We begin by considering a construction of points, lines, and incidences (such as the constructions that were presented in the first couple of posts of this series). We consider the bijection from to itself, and apply on the point-line configuration. This bijection takes every line into an axis parallel parabola. Indeed, consider a line that is parameterized as and notice that is the parabola that is parameterized as . We thus have a point-parabola configuration with incidences.
In the above example we did not rely on any properties that are specific to parabolas. For any , by considering the bijection we get a construction with curves of degree and incidences. Similarly, we may consider more involved bijections such as .
To see why the bounds that this technique implies in are subsumed by those of Elekes, let us again consider the case of parabolas that are parameterized as . We can apply the analysis that we have seen in the post about Elekes’ technique to such parabolas as follows. We set and , and define the point set to be
We define the parabola set to be
It can be easily verified that , , and . Moreover, the two techniques give the same construction (up to small changes). To see this, we apply the inverse bijection on and from the above construction. The set is an -point subset of an section of the integer lattice. The set consists of lines, each incident to one point of each column of the lattice. This is almost identical to the construction that was presented in the second post of this series, although the number of rows in the lattice becomes larger as becomes larger than (i.e., as becomes larger than ).
When considering incidences with varieties of dimension at least two, Elekes’ method seems to break down while Solymosi’s method remains valid. I plan to discuss this in a future post of this series.