一般位置的不同角度
Distinct Angles in General Position
摘要:
离散几何中普遍存在的Erdés相异距离问题。不太为人所知的是埃尔德什的独特的角度问题,问题的最低数量的不同的角度之间的$n$非共线点的平面。最近的工作已经引入了这个问题的各种变体的界限,受到距离设置中类似变体的启发。在这篇短文中,我们将已知的$n$点在一般位置上形成的不同角的最小数目的上界从$O(n^{\log_2(7)})$改进为$O(n^2)$。在这项工作之前,类似的边界依赖于从高维空间投影到一般平面上。在本文中,我们采用对数螺线的几何性质,回避了投影的需要。我们还应用此配置来减小最大整数的上限,使得一般位置中的任何$n$点集合具有该大小的子集,该子集具有所有不同的角度。该结合从$O(n^{\log_2(7)/3})$降低至$O(n^{1/2})$。
英文摘要:
The Erdős distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erdős' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the plane. Recent work has introduced bounds on a wide array of variants of this problem, inspired by similar variants in the distance setting. In this short note, we improve the best known upper bound for the minimum number of distinct angles formed by $n$ points in general position from $O(n^{\log_2(7)})$ to $O(n^2)$. Before this work, similar bounds relied on projections onto a generic plane from higher dimensional space. In this paper, we employ the geometric properties of a logarithmic spiral, sidestepping the need for a projection. We also apply this configuration to reduce the upper bound on the largest integer such that any set of $n$ points in general position has a subset of that size with all distinct angles. This bound is decreased from $O(n^{\log_2(7)/3})$ to $O(n^{1/2})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。