$\{n θ+ x\}$的置换与1/2-不等式
Substitutions and 1/2-discrepancy of $\{n θ+ x\}$
摘要:
$\{x + i θ\bmod 1\}$的1/2差异和的序列是通过在三个符号的字母表上的替换序列来实现的;特别注意的是$x=0$。第一个应用是表明,任何渐近增长率的差异总和不平凡禁止可以实现。第二个应用是证明对于不好逼近的$θ$和任何$x$,在$i=0,1,...n-1$上取值域与$\log(n)$渐近相似,这是一个比Denjoy-Koksma不等式更强的结论。
英文摘要:
The sequence of 1/2-discrepancy sums of $\{x + i θ\bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic growth rate of the discrepancy sums not trivially forbidden may be achieved. A second application is to show that for badly approximable $θ$ and any $x$ the range of values taken over $i=0,1,...n-1$ is asymptotically similar to $\log(n)$, a stronger conclusion than given by the Denjoy-Koksma inequality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。