Related papers: Dense arrangements are locally very dense I

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

We establish improved finite field Szemeredi-Trotter and Beck type theorems. First we show that if P and L are a set of points and lines respectively in the plane F_p^2, with |P|,|L| \leq N and N<p, then there are at most C_1…

We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…

Let $H$ be a set of $n$ halfplanes in $\mathbb{R}^2$ in general position, and let $k<n$ be a given parameter. We show that the number of vertices of the arrangement of $H$ that lie at depth exactly $k$ (i.e., that are contained in the…

Erd\H{o}s-Beck theorem states that $n$ points in the plane with at most $n-x$ points collinear define at least $c xn$ lines for some positive constant $c$. In this paper, we will present two ways to extend this result to higher dimensions.…

This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…

We prove some novel multi-parameter point-line incidence estimates in vector spaces over finite fields. While these could be seen as special cases of higher-dimensional incidence results, they outperform their more general counterparts in…

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

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…

In [Sharir and Solomon 2015], Sharir and Solomon showed that the number of incidences between $m$ distinct points and $n$ distinct lines in $\mathbb R^4$ is $$O^*\left(m^{2/5}n^{4/5}+ m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + m +…

A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

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…

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…

Let $\mathcal{P}$ be a set of $m$ points and $\mathcal{L}$ a set of $n$ lines in $K^2$, where $K$ is a field with char$(K)=0$. We prove the incidence bound $$\mathcal{I}(\mathcal{P},\mathcal{L})=O(m^{2/3}n^{2/3}+m+n).$$ Moreover, this bound…

We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

A classical result by Erd\H{o}s, and later on by Bondy and Simonivits, states that every $n$-vertex graph with no cycle of length $2k$ has at most $O(n^{1+1 /k})$ edges. This bound is known to be tight when $k \in \{2,3,5\},$ but it is a…

We prove analogues of the Szemer\'edi-Trotter theorem and other incidence theorems using $\delta$-tubes in place of straight lines, assuming that the $\delta$-tubes are well-spaced in a strong sense.