English
Related papers

Related papers: An Improved Point-Line Incidence Bound Over Arbitr…

200 papers

We improve the range of exponents for the restriction problem for the 3-d paraboloid over finite fields. The key new ingredient is a variant of the Bourgain-Katz-Tao finite field incidence theorem derived from sum-product estimates. In…

Classical Analysis and ODEs · Mathematics 2016-06-01 Mark Lewko

We study incidences between points and algebraic curves in three dimensions, taken from a family $C$ of curves that have almost two degrees of freedom, meaning that every pair of curves intersect in $O(1)$ points, for any pair of points…

Computational Geometry · Computer Science 2020-06-24 Micha Sharir , Noam Solomon , Oleg Zlydenko

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

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 $\mathbb{F}_{q}$ be a finite field of order $q=p^k$ where $p$ is prime. Let $P$ and $L$ be sets of points and lines respectively in $\mathbb{F}_{q} \times \mathbb{F}_{q}$ with $|P|=|L|=n$. We establish the incidence bound $I(P,L) \leq…

Combinatorics · Mathematics 2011-01-20 Timothy G. F. Jones

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 revisit Hopcroft's problem and related fundamental problems about geometric range searching. Given $n$ points and $n$ lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line…

Computational Geometry · Computer Science 2022-06-23 Timothy M. Chan , Da Wei Zheng

In this paper we prove an incidence bound for points and cubic curves over prime fields. The methods generalise those used by Mohammadi, Pham, and Warren (2021).

Combinatorics · Mathematics 2022-11-18 Audie Warren

The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…

Combinatorics · Mathematics 2007-05-23 Jozsef Solymosi

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…

Combinatorics · Mathematics 2022-02-14 A. Gafni , A. Iosevich , E. Wyman

We consider the problem of bounding the number of exceptional projections (projections which are smaller than typical) of a subset of a vector space over a finite field onto subspaces. We establish bounds that depend on $L^p$ estimates for…

Combinatorics · Mathematics 2025-04-24 Jonathan M. Fraser , Firdavs Rakhmonov

We present a technique for deriving lower bounds for incidences with hypersurfaces in ${\mathbb R}^d$ with $d\ge 4$. These bounds apply to a large variety of hypersurfaces, such as hyperplanes, hyperspheres, paraboloids, and hypersurfaces…

Combinatorics · Mathematics 2016-10-05 Adam Sheffer

We generalize the Szemer\'edi-Trotter incidence theorem, to bound the number of complete \emph{flags} in higher dimensions. Specifically, for each $i=0,1,\ldots,d-1$, we are given a finite set $S_i$ of $i$-flats in $\R^d$ or in $\C^d$, and…

Combinatorics · Mathematics 2015-12-31 Saarik Kalia , Micha Sharir , Noam Solomon , Ben Yang

An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…

Computational Geometry · Computer Science 2020-05-19 Dror Aiger , Haim Kaplan , Micha Sharir

We develop the methods used by Rudnev and Wheeler to prove an incidence theorem between arbitrary sets of M\"{o}bius transformations and point sets in $\mathbb F_p^2$. We also note some asymmetric incidence results, and give applications of…

Combinatorics · Mathematics 2022-11-18 Audie Warren , James Wheeler

In this short note, we use Rudnev's point-plane incidence bound to improve some results on conditional expanding bounds for two-variable functions over arbitrary fields due to Hegyv\'ari and Hennecart.

Combinatorics · Mathematics 2017-03-28 Hossein Nassajian Mojarrad , Thang Pham

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

We improve the theorem of Beck giving a lower bound on the number of $k$-flats spanned by a set of points in real space, and improve the bound of Elekes and T\'oth on the number of incidences between points and $k$-flats in real space.

Combinatorics · Mathematics 2020-06-29 Ben Lund

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 [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