English
Related papers

Related papers: The Szemer\'edi-Trotter theorem over arbitrary fie…

200 papers

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

We show that $m$ points and $n$ two-dimensional algebraic surfaces in $\mathbb{R}^4$ can have at most $O(m^{\frac{k}{2k-1}}n^{\frac{2k-2}{2k-1}}+m+n)$ incidences, provided that the algebraic surfaces behave like pseudoflats with $k$ degrees…

Combinatorics · Mathematics 2018-07-18 Joshua Zahl

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

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

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

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

In additive combinatorics, Erd\"{o}s-Szemer\'{e}di Conjecture is an important conjecture. It can be applied to many fields, such as number theory, harmonic analysis, incidence geometry, and so on. Additionally, its statement is quite easy…

Combinatorics · Mathematics 2023-10-13 Sung-Yi Liao

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 establish a group-action version of the Szemer\'edi-Trotter theorem over any field, extending Bourgain's result for the group $\mathrm{SL}_2(k)$. As an Elekes-Szab\'o-type application, we obtain quantitative bounds on the number of…

Combinatorics · Mathematics 2024-12-09 Yifan Jing , Tingxiang Zou

We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…

Logic · Mathematics 2017-07-14 Saugata Basu , Orit E. Raz

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 prove distality of quantifier-free relations on valued fields with finite residue field. By a result of Chernikov-Galvin-Starchenko, this yields Szemer\'edi-Trotter-like incidence bounds for function fields over finite fields. We deduce…

Logic · Mathematics 2026-04-15 Martin Bays , Jean-François Martin

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

Given a set of $n$ points in $R^2$, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least $k > 1$ of these points is $O(n^2/k^3 + n/k)$. J.\ Solymosi conjectured that if one requires the…

Combinatorics · Mathematics 2014-07-31 G. Amirkhanyan , A. Bush , E. Croot , C. Pryby

We study configurations of $n$ points and $n$ lines that form $\Theta(n^{4/3})$ incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel…

Combinatorics · Mathematics 2022-10-11 Adam Sheffer , Olivine Silier

The symmetric case of the Szemer\'edi-Trotter theorem says that any configuration of $N$ lines and $N$ points in the plane has at most $O(N^{4/3})$ incidences. We describe a recipe involving just $O(N^{1/3})$ parameters which sometimes…

Combinatorics · Mathematics 2023-03-31 Nets Katz , Olivine Silier

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…

Combinatorics · Mathematics 2023-08-08 Hung Le , Steven Senger , Minh-Quan Vo

We prove new incidence bounds between a plane point set, which is a Cartesian product, and a set of translates $H$ of the hyperbola $xy=\lambda\neq 0$, over a field of asymptotically large positive characteristic $p$. They improve recent…

Combinatorics · Mathematics 2021-04-22 Misha Rudnev , James Wheeler
‹ Prev 1 2 3 10 Next ›