
The current best upper bound, taken from [1], is I(P,L)≤2.44|P|2/3|L|2/3(this im-
proves the previous bound of 2.5 from [14]). The status of the lower bound is not as simple.
During the 20th century, only a single construction with Θ(|P|2/3|L|2/3) incidences was
known, due to Erd˝os (see Section 2). Pach and T´oth [15] analyzed Erd˝os’s construction,
to obtain c|P|2/3|L|2/3incidences, where c= (3/4π2)1/3≈0.42. Most of the steps of this
analysis were omitted in the paper [15], making it difficult to verify. Twenty years later,
Cibulka, Valtr, and the first author of the current work [12] spotted a mistake in the part of
the analysis in [15] that did appear on the paper. Fixing this mistake leads to the improved
bound c= 3 ·(3/4π2)1/3≈1.27. It remained unclear whether additional issues appear in
the portion of the analysis that is omitted in [15].
In the early 2000s, Elekes [9] discovered a simpler point–line configuration that achieves
Θ(|P|2/3|L|2/3) incidences (see Section 2). The best constant previously obtained for this
construction was by Apfelbaum [2], who showed that I(P,L)≥ |P|2/3|L|2/3. In other words,
Apfelbaum obtained the constant c= 1.
We set n=|P|. In Erd˝os’s construction, Pis a √n×√nsection of the integer lattice.
In Elekes’s construction, Pis a much taller and thinner section of the integer lattice. Re-
cently, Silier and the second author of the current work [17] discovered an infinite family of
constructions with Θ(|P|2/3|L|2/3) incidences. In this family, the point set is an nα×n1−α
section of the integer lattice, where 1/3≤α≤1/2. Erd˝os’s construction is obtained when
α= 1/2 and Elekes’s construction is obtained when α= 1/3. For a description of this
family, see Section 2. Previously, no work analyzed the constants of these constructions.
The following theorem is the main result of the current work.
Theorem 1.2. Consider a construction P,Lfrom the infinite family with 1/3≤α≤1/2,
|L| =o(|P|2), and |L| =ω(|P|2−3α). Then I(P,L)=(c+o(1))|P|2/3|L|2/3, where c=
3·(3/4π2)1/3≈1.27.
The condition |L| =o(|P|2) only means that we are in the main case, where the number
of incidences is dominated by the term |P|2/3|L|2/3. The condition |L| =ω(|P|2−3α) is more
restrictive when α < 1/2. For example, when α= 1/3, this condition asks for the number
of lines to be asymptotically larger than the number of points.
We believe that Theorem 1.2 is of interest for several reasons:
•Generalizing the analysis of Erd˝os’s construction to the entire family is not trivial and
requires multiple new ideas.
•The constant of Elekes’s construction is improved from 1 to about 1.27.
•From an expository perspective, the proof from [15] is now fully explained and verified.
This clarifies some details, such as that an additional +o(1) should appear in the
bound.
Recently, Guth and Silier [10] discovered another infinite family of constructions with
Θ(|P|2/3|L|2/3) incidences. It may be interesting to analyze the constants of this family.
In Section 2, we describe the constructions of Erd˝os and Elekes, and the infinite family of
constructions. In Section 3, we derive a variety of results related to Euler’s totient function,
which are required in our analysis. In Section 4, we prove Theorem 1.2.
2 The constructions
The purpose of this section is to briefly provide intuition for Erd˝os’s construction, Elekes’s
construction, and the infinite family of constructions from [17]. For simplicity and intuition,
2