Incidences between points and lines in three dimensions (Q2417591): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Micha Sharir / rank | |||
Property / reviewed by | |||
Property / reviewed by: László A. Székely / rank | |||
Property / author | |||
Property / author: Micha Sharir / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: László A. Székely / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2949285938 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:44, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Incidences between points and lines in three dimensions |
scientific article |
Statements
Incidences between points and lines in three dimensions (English)
0 references
12 June 2019
0 references
\textit{L. Guth} and \textit{N. H. Katz} [Ann. Math. (2) 181, No. 1, 155--190 (2015; Zbl 1310.52019)] were the first to prove that for $m$ points and $n$ lines in $\mathbb{R}^3$, the number of incidences is at most \[ O(m^{1/2}n^{3/4}+m^{2/3}n^{1/3} s^{1/3} +m+n), \] if no plane contains more than $s$ lines. (The constant depends on the relation between $m$ and $n$.) This was the key step in their solution of the distinct distances problem of Erdős. The paper under review provides a new proof for this result, which is simpler, more elementary, and somewhat stronger. The method of the new proof is more likely applicable to further incidence problems than the original approach. For the entire collection see [Zbl 1411.52002].
0 references
point-line incidences
0 references
Szemerédi-Trotter theorem
0 references