关于定义少数普通超平面的集合
On sets defining few ordinary hyperplanes
摘要:
设$P$是实射影$d$ -空间中的一组$n$点,不都包含在超平面中,使得任何$d$点都跨越超平面。$P$的普通超平面是恰好包含$P$的$d$点的超平面。我们证明,如果$d\ge 4$,$P$的普通超平面的数量至少是$\binom{n-1}{d-1} - O_d(n^{\lfloor(d-1)/2\rfloor})$,如果$n$是足够大的$d$。这个界是紧的,给定$d$,我们可以计算出足够大的$n$的精确最小数。这是一个结构定理的结果,为少数普通超平面:对于任何$d \ge 4$和$K > 0$,如果$n \ge C_d K^8$为一些常数$C_d > 0$依赖于$d$和$P$跨度最多$K\binom{n-1}{d-1}$普通超平面,那么所有但最多$O_d(K)$点的$P$谎言超平面,椭圆正常曲线,或合理的非节点曲线。我们还找到了最大数量的$(d+1)$ -点超平面,解决了$d$维类似的果园问题。我们的证明依赖于绿色和陶的结果对普通的线路,我们以前的工作$3$维的情况下,以及结果从古典代数几何。
英文摘要:
Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if $d\ge 4$, the number of ordinary hyperplanes of $P$ is at least $\binom{n-1}{d-1} - O_d(n^{\lfloor(d-1)/2\rfloor})$ if $n$ is sufficiently large depending on $d$. This bound is tight, and given $d$, we can calculate the exact minimum number for sufficiently large $n$. This is a consequence of a structure theorem for sets with few ordinary hyperplanes: For any $d \ge 4$ and $K > 0$, if $n \ge C_d K^8$ for some constant $C_d > 0$ depending on $d$ and $P$ spans at most $K\binom{n-1}{d-1}$ ordinary hyperplanes, then all but at most $O_d(K)$ points of $P$ lie on a hyperplane, an elliptic normal curve, or a rational acnodal curve. We also find the maximum number of $(d+1)$-point hyperplanes, solving a $d$-dimensional analogue of the orchard problem. Our proofs rely on Green and Tao's results on ordinary lines, our earlier work on the $3$-dimensional case, as well as results from classical algebraic geometry.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。