English
Related papers

Related papers: On grids in point-line arrangements in the plane

200 papers

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

Combinatorics · Mathematics 2009-03-12 Jozsef Solymosi , Konrad J. Swanepoel

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…

Combinatorics · Mathematics 2015-03-26 Micha Sharir , Noam Solomon

We completely characterize point--line configurations with $\Theta(n^{4/3})$ incidences when the point set is a section of the integer lattice. This can be seen as the main special case of the structural Szemer\'edi-Trotter problem. We also…

Combinatorics · Mathematics 2023-10-03 Shival Dasu , Adam Sheffer , Junxuan Shen

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…

Combinatorics · Mathematics 2017-05-31 Micha Sharir , Noam Solomon

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…

Combinatorics · Mathematics 2025-10-20 Jiahe Shen

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…

Combinatorics · Mathematics 2012-07-17 Ida Kantor , Balazs Patkos

We prove an incidence theorem for points and curves in the complex plane. Given a set of $m$ points in ${\mathbb R}^2$ and a set of $n$ curves with $k$ degrees of freedom, Pach and Sharir proved that the number of point-curve incidences is…

Combinatorics · Mathematics 2018-07-18 Adam Sheffer , Endre Szabó , Joshua Zahl

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…

Combinatorics · Mathematics 2022-02-11 Micha Sharir , Noam Solomon

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 +…

Combinatorics · Mathematics 2016-12-09 Noam Solomon , Ruixiang Zhang

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

Combinatorics · Mathematics 2018-07-10 Jordan S. Ellenberg , Jozsef Solymosi , Joshua Zahl

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…

Combinatorics · Mathematics 2016-12-09 Frank de Zeeuw

We use methods from spectral graph theory to obtain bounds on the number of incidences between $k$-planes and $h$-planes in $\mathbb{F}_q^d$ which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More…

Combinatorics · Mathematics 2015-10-14 Nguyen Duy Phuong , Thang Pham , Le Anh Vinh

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

Combinatorics · Mathematics 2015-01-29 Pierre Aboulker , Guillaume Lagarde , David Malec , Abhishek Methuku , Casey Tompkins

Let $I(n,l)$ denote the maximum possible number of incidences between $n$ points and $l$ lines. It is well known that $I(n,l) = \Theta(n^{2/3}l^{2/3} + n + l)$. Let $c_{\mathrm{SzTr}}$ denote the lower bound on the constant of…

Computational Geometry · Computer Science 2017-07-18 Roel Apfelbaum

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…

Combinatorics · Mathematics 2015-03-20 Zeev Dvir

Let $P = A\times A \subset \mathbb{F}_p \times \mathbb{F}_p$, $p$ a prime. Assume that $P= A\times A$ has $n$ elements, $n<p$. See $P$ as a set of points in the plane over $\mathbb{F}_p$. We show that the pairs of points in $P$ determine…

Combinatorics · Mathematics 2014-01-14 Harald Andres Helfgott , Misha Rudnev

We estimate the number of incidences in a configuration of $m$ lines and $n$ points in dimension 3. The main term is $mn^{1/3}$ if we work over the real or complex numbers but $mn^{2/5}$ over finite fields. Both of these are optimal, aside…

Combinatorics · Mathematics 2014-12-05 János Kollár

We study a lower bound for the constant of the Szemer\'edi-Trotter theorem. In particular, we show that a recent infinite family of point-line configurations satisfies $I({\mathcal P},{\mathcal L})\ge (c+o(1)) |{\mathcal P}|^{2/3}|{\mathcal…

Combinatorics · Mathematics 2022-10-11 Martin Balko , Adam Sheffer , Ruiwen Tang

Let $q$ be a power of a prime and $\mathbb{F}_q$ the finite field consisting of $q$ elements. We prove explicit upper bounds on the number of incidences between lines and Cartesian products in $\mathbb{F}_q^2$. We also use our results on…

Combinatorics · Mathematics 2018-08-17 Ali Mohammadi

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…

Combinatorics · Mathematics 2021-07-01 Misha Rudnev