由网格构造的稠密森林
Dense Forests Constructed from Grids
AI总结:
本文研究平移格有限并构成的稠密森林,给出其判定充要条件,并基于 Iwasawa 分解证明一般情形下具有接近最优的有效可见度界。
摘要:
稠密森林是满足如下性质的集合 $F\subset\mathbb{R}^n$:对于所有 $\varepsilon>0$,存在一个数 $V(\varepsilon)>0$,使得所有长度为 $V(\varepsilon)$ 的线段都与 $F$ 中的某一点 $\varepsilon$-接近。函数 $V$ 称为 $F$ 的可见度函数。本文研究由平移格(网格)的有限并所构造的稠密森林。首先,我们依据定义这些网格的矩阵的无理数性质,给出了一个有限网格并成为稠密森林的充要条件。这回答了 Adiceam、Solomon 和 Weiss(2022)提出的一个问题。作为补充,我们进一步证明这类集合在以下意义上一般都具有有效可见度界:对于所有 $\eta>0$,存在 $k\in\mathbb{N}$,使得几乎所有 $k$ 个网格的并都是稠密森林,并具有满足 $V(\varepsilon)\ll\varepsilon^{-(n-1)-\eta}$ 的可见度函数。这在任意程度上都接近最优,因为如果一个有限网格并具有可见度函数 $V$,则该函数必然满足 $V(\varepsilon)\gg\varepsilon^{-(n-1)}$。本工作的主要创新之一是,“几乎所有”这一概念是相对于若干底层测度来考虑的,这些测度依据用于定义网格的矩阵的 Iwasawa 分解来定义。在这方面,本文所得结果极大地推广了 Adiceam、Solomon 和 Weiss(2022)的结果;他们曾针对一类特定的一般幺模格族给出类似的有效可见度界。
英文摘要:
A dense forest is a set $F \subset \mathbb{R}^n$ with the property that for all $\varepsilon > 0$ there exists a number $V(\varepsilon) > 0$ such that all line segments of length $V(\varepsilon)$ are $\varepsilon$-close to a point in $F$. The function $V$ is called a visibility function of $F$. In this paper we study dense forests constructed from finite unions of translated lattices (grids). First, we provide a necessary and sufficient condition for a finite union of grids to be a dense forest in terms of the irrationality properties of the matrices defining them. This answers a question raised by Adiceam, Solomon, and Weiss (2022). To complement this, we further show that such sets generically admit effective visibility bounds in the following sense: for all $η> 0$, there exists a $k \in \mathbb{N}$ such that almost all unions of $k$ grids are dense forests admitting a visibility function $V(\varepsilon) \ll \varepsilon^{-(n-1) -η}$. This is arbitrarily close to optimal in the sense that if a finite union of grids admits a visibility function $V$, then this function necessarily satisfies $V(\varepsilon) \gg \varepsilon^{-(n-1)}$. One of the main novelties of this work is that the notion of `almost all' is considered with respect to several underlying measures, which are defined according to the Iwasawa decomposition of the matrices used to define the grids. In this respect, the results obtained here vastly extend those of Adiceam, Solomon, and Weiss (2022) who provided similar effective visibility bounds for a particular family of generic unimodular lattices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。