arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.02773math.NTcs.CG
收藏

Danzer问题、稠密森林的有效构造与数字序列

Danzer's Problem, Effective Constructions of Dense Forests and Digital Sequences

Ioannis Tsokanos

摘要:

一个1965年的问题,由于丹泽问是否存在一套在欧几里得空间与有限密度相交的任何凸体的体积之一。最近的一种解决方法是建造茂密的森林,并通过适当削弱体积约束来获得。稠密森林是一个有限密度的离散点集,它均匀地接近足够长的线段。然后,在一个稠密的森林中的点的分布量化的可见性功能。另一种削弱丹泽问题中假设的方法是放松密度约束。在这方面,本文引入了一个新的概念,即光学森林。$\mathbb{R}^{d}$中的光学森林是具有最佳可见性但不一定具有有限密度的点集。在文献中,Danzer集和密林的最佳构造缺乏有效性。本文的目标是提供密集和光学森林的建设,在任何维度$d \ge 2$的能见度和密度界限和有效性方面产生最知名的结果。即,本文的主要结果有三个:(1)构造了一个稠密森林,它具有已知的最佳可见性界,而且具有确定性;(2)确定性地构造一个密度在对数以内不为有限的光学森林;(3)构造一个平面Peres型森林(即,从Peres的构造中获得的茂密森林),具有最知名的可见性边界。这是通过构造满足强色散特性的确定性数字序列来实现的。

英文摘要:

A 1965 problem due to Danzer asks whether there exists a set in Euclidean space with finite density intersecting any convex body of volume one. A recent approach to this problem is concerned with the construction of dense forests and is obtained by a suitable weakening of the volume constraint. A dense forest is a discrete point set of finite density getting uniformly close to long enough line segments. The distribution of points in a dense forest is then quantified in terms of a visibility function. Another way to weaken the assumptions in Danzer's problem is by relaxing the density constraint. In this respect, a new concept is introduced in this paper, namely that of an optical forest. An optical forest in $\mathbb{R}^{d}$ is a point set with optimal visibility but not necessarily with finite density. In the literature, the best constructions of Danzer sets and dense forests lack effectivity. The goal of this paper is to provide constructions of dense and optical forests which yield the best known results in any dimension $d \ge 2$ both in terms of visibility and density bounds and effectiveness. Namely, there are three main results in this work: (1) the construction of a dense forest with the best known visibility bound which, furthermore, enjoys the property of being deterministic; (2) the deterministic construction of an optical forest with a density failing to be finite only up to a logarithm and (3) the construction of a planar Peres-type forest (that is, a dense forest obtained from a construction due to Peres) with the best known visibility bound. This is achieved by constructing a deterministic digital sequence satisfying strong dispersion properties.

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

↑