相关论文: On the Dimension of Finite Point Sets I. An Improv…
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…
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…
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…
This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…
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…
We use spectral theory and algebraic geometry to establish a higher-degree analogue of a Szemer\'edi--Trotter-type theorem over finite fields, with an application to polynomial expansion.
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
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…
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…
We prove analogues of the Szemer\'edi-Trotter theorem and other incidence theorems using $\delta$-tubes in place of straight lines, assuming that the $\delta$-tubes are well-spaced in a strong sense.
We prove sharp estimates for incidences involving planar tubes that satisfy packing conditions. We apply them to improve the estimates for the Fourier transform of fractal measures supported on planar curves.
The main purpose of this paper is to prove that the point-line incidence bound due to Vinh (2011) over arbitrary finite fields can be improved in certain ranges by using tools from the VC-dimension theory. As consequences, a number of…
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…
We present some new sharp constructions for the Szemer\'{e}di-Trotter theorem. These constructions generalize previous work of Erd\H{o}s, Elekes, Sheffer and Silier, Guth and Silier, and the author. In the past, arguments showing the…
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…
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…
We prove new general results on sumsets of sets having Szemer\'edi--Trotter type. This family includes convex sets, sets with small multiplicative doubling, images of sets under convex/concave maps and others.
We prove an incidence result counting the $k$-rich $\delta$-tubes induced by a well-spaced set of $\delta$-atoms. Our result coincides with the bound that would be heuristically predicted by the Szemer\'edi--Trotter Theorem and holds in all…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
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…