English
Related papers

Related papers: Incidences between points and lines in three dimen…

200 papers

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…

Computational Geometry · Computer Science 2009-05-12 György Elekes , Haim Kaplan , Micha Sharir

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…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

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

Algebraic Geometry · Mathematics 2015-06-03 Micha Sharir , Noam Solomon

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…

Combinatorics · Mathematics 2015-12-07 Misha Rudnev

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

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

The point-plane incidence theorem states that the number of incidences between $n$ points and $m\geq n$ planes in the projective three-space over a field $F$, is $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear…

Combinatorics · Mathematics 2018-06-12 Misha Rudnev

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…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

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…

Combinatorics · Mathematics 2019-02-20 Micha Sharir , Adam Sheffer , Joshua Zahl

We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…

Metric Geometry · Mathematics 2015-12-31 Micha Sharir , Shakhar Smorodinsky , Claudiu Valculescu , Frank de Zeeuw

We consider an incidence problem in $\mathbb{R}^4$ which asks, for a set of $L$ lines and a set of $S$ planes in general position, what the maximum number of line-plane incidences is. A line-plane incidence is defined as a point where a…

Combinatorics · Mathematics 2023-12-27 Chao Cheng

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…

Combinatorics · Mathematics 2017-08-16 Sophie Stevens , Frank de Zeeuw

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

The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

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 prove that the number of incidences between $m$ points and $n$ bounded-degree curves with $k$ degrees of freedom in ${\mathbb R}^d$ is \[ I(m,n) =O\left(m^{\frac{k}{dk-d+1}+\varepsilon}n^{\frac{dk-d}{dk-d+1}}+ \sum_{j=2}^{d-1}…

Combinatorics · Mathematics 2015-12-29 Micha Sharir , Adam Sheffer , Noam Solomon

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

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

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…

Algebraic Geometry · Mathematics 2014-05-09 János Kollár

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…

Combinatorics · Mathematics 2018-07-18 Joshua Zahl
‹ Prev 1 2 3 10 Next ›