On the Number of Incidences Between Points and Planes in Three Dimensions

被引:57
|
作者
Rudnev, Misha [1 ]
机构
[1] Univ Bristol, Dept Math, Bristol BS8 1TW, Avon, England
基金
美国国家科学基金会;
关键词
DISTINCT DISTANCES PROBLEM; SETS; BOUNDS; SUMS;
D O I
10.1007/s00493-016-3329-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove an incidence theorem for points and planes in the projective space a"(TM)(3) over any Field , whose characteristic p not equal 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 P-3, with m >= n as O (m root n vertical bar mk), where k is the maximum number of collinear planes, provided that n = O(p (2)) 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 SaS dagger F-2 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 . This is also the best known bound over a"e, where it follows from the Szemer,di-Trotter theorem. Also, a set S aS dagger F-3, not supported in a single semi-isotropic plane contains a point, from which distinct distances to other points of S are attained.
引用
收藏
页码:219 / 254
页数:36
相关论文
共 50 条