arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.09960math.COmath.MG
收藏

角链和销接变型

Angle chains and pinned variants

Eyvindur Ari Palsson, Steven Senger, Charles Wolf

摘要:

我们研究的Erd \H OS单位距离问题的一个变体,涉及从一个大的有限点集选择的点的连续三元组之间的角度。具体来说,给定一个大的有限集$n$点$E$,和一个序列的角度$(α_1,\ldots,α_k)$,我们给出的最大可能的元组的不同点$(x_1,\dots, x_{k+2})\in E^{k+2}$满足$\angle (x_j,x_{j+1},x_{j+2})=α_j$的上限和下界为每个$1\le j \le k$以及固定的类似物。

英文摘要:

We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of angles $(α_1,\ldots,α_k)$, we give upper and lower bounds on the maximum possible number of tuples of distinct points $(x_1,\dots, x_{k+2})\in E^{k+2}$ satisfying $\angle (x_j,x_{j+1},x_{j+2})=α_j$ for every $1\le j \le k$ as well as pinned analogues.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑