arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.01778math.LO
收藏

数学随机性与傅里叶分析

Algorithmic randomness and Fourier analysis

Johanna Franklin, Timothy McNicholl, Jason Rute

摘要:

假设$1 < p < \infty$。Carleson定理指出,在$L^p[-π, π]$中任何函数的傅里叶级数几乎处处收敛。我们表明,Schnorr随机点正是那些满足这个定理的每个$f \in L^p[-π, π]$给定的自然可计算性条件$f$和$p$。

英文摘要:

Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-π, π]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L^p[-π, π]$ given natural computability conditions on $f$ and $p$.

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

↑