Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the number of incidences between points and planes in three dimensions (1407.0426v5)

Published 1 Jul 2014 in math.CO

Abstract: We prove an incidence theorem for points and planes in the projective space $\mathbb P3$ 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 canonical rulings of the Klein quadric. The Klein quadric can be traversed by a generic hyperplane, yielding a line-line incidence problem in a three-quadric, the Klein image of a regular line complex. This hyperplane can be chosen so that at most two lines meet. Hence, one can apply an algebraic theorem of Guth and Katz, with a constraint involving $p$ if $p>0$. This yields a bound on the number of incidences between $m$ points and $n$ planes in $\mathbb P3$, with $m\geq n$ as $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear planes, provided that $n=O(p2)$ if $p>0$. Examples show that this bound cannot be improved without additional assumptions. This gives one a vehicle to establish geometric incidence estimates when $p>0$. For a non-collinear point set $S\subseteq \mathbb F2$ and a non-degenerate symmetric or skew-symmetric bilinear form $\omega$, the number of distinct values of $\omega$ on pairs of points of $S$ is $\Omega\left[\min\left(|S|{\frac{2}{3}},p\right)\right]$. This is also the best known bound over $\mathbb R$, where it follows from the Szemer\'edi-Trotter theorem. Also, a set $S\subseteq \mathbb F3$, not supported in a single semi-isotropic plane contains a point, from which $\Omega\left[\min\left(|S|{\frac{1}{2}},p\right)\right]$ distinct distances to other points of $S$ are attained.

Summary

We haven't generated a summary for this paper yet.