算法随机布朗运动测度的Fourier谱
Fourier spectra of measures associated with algorithmically random Brownian motion
摘要:
本文研究了在算法随机布朗运动下分形集的象支持的Radon测度的傅里叶变换在无穷远处的行为。我们表明,在一些可计算性条件下,这些集,傅立叶变换的相关措施,相对于这些集的Hausdorff尺寸,最佳渐近衰减在无穷大。该论点在很大程度上依赖于一个直接的表征,由于Asarin和Pokrovskii,算法随机布朗运动的前缀自由Kolmogorov复杂性的有限二进制序列。这项研究还需要从可计算的角度仔细研究分形的潜在理论。
英文摘要:
In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion. We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff dimensions of these sets, optimal asymptotic decay at infinity. The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the prefix free Kolmogorov complexity of finite binary sequences. The study also necessitates a closer look at the potential theory over fractals from a computable point of view.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。