In this post and in the following one I will present a bound on the maximum number of incidences between points and varieties in

, for any

. This week

Martin Sombra stated it as an open conjecture during his very nice talk at

IPAM, while presenting a joint work with

Saugata Basu. We actually had this result hidden in our basement for a while, and this seems to be a good the time to present it. The bound will appear in a more general form in a paper by Jacob Fox, János Pach, Andrew Suk, Joshua Zahl, and myself. My plan is to discuss this incidences bound and to present some of the required preliminaries in this post, and then to give a full proof in a following post (after I return from a one week vacation).

* Martin Sombra and Saugata Basu.*

Let us first recall a general incidences result in the plane.

**Theorem 1 (Pach and Sharir `98).** *Consider a set of points , a set of simple curves, both in , and two constant positive integers and , such that (i) For every points of there are at most curves of that are incident to each of the points, and (ii) Every two curves of intersect in at most points. Then where the constant of proportionality depends on and . *
Does there exist such a general bound when the dimension is larger than 2? At first, it might not be immediately clear how the higher-dimensional question should be formulated, even for the simple case of hyperplanes. On one hand, if we ask every pair of hyperplanes to intersect in at most some constant number of points, we allow only the boring case of a set of parallel hyperplanes. On the other hand, if we completely remove the condition concerning common intersection points, we obtain a different boring scenario – all of the hyperplanes can intersect in a common line that contains all of the points. That is, we can have

incidences.

So how can we properly formulate an incidence problem between points and varieties in

? The natural (and popular) formulation is to add the restriction that the incidence graph does not contain a copy of

(that is, that for every subset of

points of

, at most

of the varieties can be incident to all of the points of the subset). Notice that this restriction forbids the problematic situation of many hyperplanes through a common line, while not forcing a degenerate structure of the arrangement of the hyperplanes.

Let us now return to our question: Does there exist such a general bound when the dimension is larger than 2? In fact, such a bound was already known for a while, though it is somewhat hidden inside

a paper by Elekes and Szabó. If we slightly change the proof of Theorem 9 in that paper, we obtain the following

-dimensional bound.

**Theorem 2 (Elekes and Szabó).** *Consider a set of points and a set of constant-degree algebraic varieties, both in , such that the incidences graph does not contain a copy of (for some constants ). Then for any *
To prove this theorem, Elekes and Szabó relied on the

*cutting* technique. This technique has an inefficiency in dimensions

, which yielded the various 2’s in the exponents of the bound of Theorem 2. By replacing the cutting with

*polynomial partitioning*, we obtain the following improved bound.

**Theorem 3 (Fox, Pach, Suk, Sheffer, and Zahl).** *Consider a set of points and a set of constant-degree algebraic varieties, both in , such that the incidences graph does not contain a copy of (for some constants ). Then for any *
Theorem 3 generalizes many of the existing incidences bounds, up to the extra in the exponent. Some examples:

- When , we obtain the Pach-Sharir bound of Theorem 1.
- When , we obtain the bounds by Zahl and by Kaplan, Matoušek, Safernová, and Sharir.
- When , we obtain the bound derived by Basu and Sombra (and presented by Martin in his recent IPAM talk).
- Edelsbrunner, Guibas, and Sharir considered point-plane incidences in , where no three points are collinear. Theorem 3 generalizes this result to , where no points are contained in a common -flat. A further generalization is to other types of hypersurfaces, such as spheres.

Basu and Sombra derived their bound

*without the extra in the exponent*, for the specific case of hypersurfaces in

. Their technique is based on

Hilbert polynomials. Hopefully their technique can be extended to the general case.

Given a hypersurface

in

, we say that a

*patch* of

is a (possibly open) continuous piece of

of any dimension. We say that a patch

of

is

*monotone* if there exists a hyperplane

such that

can be injectively projected onto

.

A

*cylindrical algebraic decomposition* (or

*CAD* for short) partitions a hypersurface

into monotone patches. Some of the patches in the CAD partitioning might be of a dimension smaller than

and can thus be injectively projected onto a lower dimensional flat. However, we do not require this property, and project each of the patches on a

-dimensional hyperplane. One may also assume that all of the corresponding hyperplanes have the same normal direction, but we do not require this property either. The following theorem and additional details can be found in Chapters 5 and 11 of the book

Algorithms in Real Algebraic Geometry by Basu, Pollack, and Roy.

**Theorem 4.** *Let be a hypersurface in of degree . Then can be partitioned into monotone patches. *