Related papers: On Lines, Joints, and Incidences in Three Dimensio…
We give a fairly elementary and simple proof that shows that the number of incidences between $m$ points and $n$ lines in ${\mathbb R}^3$, so that no plane contains more than $s$ lines, is $$ O\left(m^{1/2}n^{3/4}+ m^{2/3}n^{1/3}s^{1/3} + m…
We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…
We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…
Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…
Let $L$ be a set of $n$ lines in $\reals^d$, for $d\ge 3$. A {\em joint} of $L$ is a point incident to at least $d$ lines of $L$, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum…
Guth and Katz proved that, as conjectured by Elekes and Sharir, $m$ lines in 3-space have at most constant times $ m^{3/2}$ intersection points, aside from some obvious counter examples. We give an explicit bound for the constant, using the…
We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…
We study incidence problems involving points and curves in $R^3$. The current (and in fact only viable) approach to such problems, pioneered by Guth and Katz, requires a variety of tools from algebraic geometry, most notably (i) the…
As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…
We show that the number of incidences between $m$ distinct points and $n$ distinct lines in ${\mathbb R}^4$ is $O\left(2^{c\sqrt{\log m}} (m^{2/5}n^{4/5}+m) + m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + n\right)$, for a suitable…
We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…
We show that $m$ points and $n$ smooth algebraic surfaces of bounded degree in $\mathbb{R}^3$ satisfying suitable nondegeneracy conditions can have at most $O(m^{\frac{2k}{3k-1}}n^{\frac{3k-3}{3k-1}}+m+n)$ incidences, provided that any…
We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is…
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…
Let $L$ be a set of $n$ lines in $R^3$ that is contained, when represented as points in the four-dimensional Pl\"ucker space of lines in $R^3$, in an irreducible variety $T$ of constant degree which is \emph{non-degenerate} with respect to…
A regular linear line complex is a three-parameter set of lines in space, whose Pl\"ucker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of…
In this paper we establish an improved bound for the number of incidences between a set $P$ of $m$ points and a set $H$ of $n$ planes in $\mathbb R^3$, provided that the points lie on a two-dimensional nonlinear irreducible algebraic…
In this note we give a shortened proof of a theorem of Rudnev, which bounds the number of incidences between points and planes over an arbitrary field. Rudnev's proof uses a map that goes via the four-dimensional Klein quadric to a…
Given a set of points $P$ and a set of regions $\mathcal{O}$, an incidence is a pair $(p,o ) \in P \times \mathcal{O}$ such that $p \in o$. We obtain a number of new results on a classical question in combinatorial geometry: What is the…
The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…