关于不均匀图定向自相似集的覆盖数
Covering number on inhomogeneous graph-directed self-similar sets
AI总结:
研究不均匀图定向自相似集在r→0时的覆盖数渐进行为,基于吸引子的Minkowski维度,推导了覆盖数与积分条件的关系。
摘要:
对于满足强开集条件的强连通不均匀图定向自相似集K^C,我们通过吸引子的Minkowski维度s_0(G)来刻画r→0时的r-覆盖数N_r(K^C)的渐进行为。如果对于所有顶点i,积分∫₀^∞ e^{-s_0(G)t}N_{e^{-t}}(C_i)dt收敛,则e^{-s_0(G)t}N_{e^{-t}}(K^C)在t→∞时有极限,当log-收缩群G_M为R时极限为正常数,当G_M为晶格时极限为正周期函数;若某些i的积分发散,则极限为无穷大。
英文摘要:
For a strongly connected inhomogeneous graph-directed self-similar set $K^C$ satisfying the strong open set condition, we characterize the asymptotic behaviour of the $r$-covering number $N_r(K^C)$ as $r \downarrow 0$ in terms of the Minkowski dimension $s_0(G)$ of the attractor. If $\int_0^\infty e^{-s_0(G)t}N_{e^{-t}}(C_i)\,\mathrm{d} t<\infty$ for all vertices $i$, then $e^{-s_0(G)t}N_{e^{-t}}(K^C)$ has a limit as $t\to\infty$, which is a positive constant when the log-contraction group $G_M$ is $\mathbb{R}$ and a positive periodic function when $G_M$ is a lattice; if the integral diverges for some $i$, the limit is infinite.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。