English
Related papers

Related papers: The Constant of Proportionality in Lower Bound Con…

200 papers

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

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…

Combinatorics · Mathematics 2025-09-29 Martin Balko , Nóra Frankl

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

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

Combinatorics · Mathematics 2015-01-13 Micha Sharir , Noam Solomon

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

Let P be a set of points and $L$ a set of lines in (F_p)^2, with |P|,|L|\leq N and N<p. We show that P and L generate no more than C N^(3/2 - 1/806 + o(1)) incidences for some absolute constant C. This improves by an order of magnitude on…

Combinatorics · Mathematics 2011-11-03 Timothy G. F. Jones

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 $p_1,\ldots,p_n$ be a set of points in the unit square and let $T_1,\ldots,T_n$ be a set of $\delta$-tubes such that $T_j$ passes through $p_j$. We prove a lower bound for the number of incidences between the points and tubes under a…

Combinatorics · Mathematics 2025-03-19 Alex Cohen , Cosmin Pohoata , Dmitrii Zakharov

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

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

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…

Combinatorics · Mathematics 2019-11-27 Mozhgan Mirzaei , Andrew Suk , Jacques Verstraëte

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

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…

Combinatorics · Mathematics 2012-06-21 Timothy G. F. Jones

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

Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…

Combinatorics · Mathematics 2021-06-21 Ashwin Sah

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

It is shown that $n$ points and $e$ lines in the complex Euclidean plane ${\mathbb C}^2$ determine $O(n^{2/3}e^{2/3}+n+e)$ point-line incidences. This bound is the best possible, and it generalizes the celebrated theorem by Szemer\'edi and…

Combinatorics · Mathematics 2015-07-10 Csaba D. Toth
‹ Prev 1 2 3 10 Next ›