${\Bbb R}^d$的薄子集内的有限树
Finite trees inside thin subsets of ${\Bbb R}^d$
摘要:
Bennett、Iosevich和Taylor证明了豪斯多夫维数大于$\frac{d+1}{2}$的${\Bbb R}^d$、$d \ge 2$的紧子集包含任意长度的链,且在非平凡区间内有间隙。在本文中,我们推广到任意树配置的结果。
英文摘要:
Bennett, Iosevich and Taylor proved that compact subsets of ${\Bbb R}^d$, $d \ge 2$, of Hausdorff dimensions greater than $\frac{d+1}{2}$ contain chains of arbitrary length with gaps in a non-trivial interval. In this paper we generalize this result to arbitrary tree configurations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。