arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.07281math.NTcs.NAmath.FAmath.NA
收藏

二维数字序列的最优L_p不均衡性界

Optimal $L_p$-discrepancy bounds for second order digital sequences

Josef Dick, Aicke Hinrichs, Lev Markhasin, Friedrich Pillichshammer

AI总结:

本文研究了二维数字序列的L_p不均衡性界,证明了此类序列在所有p>1的情况下均达到最优顺序。

摘要:

L_p不均衡性是衡量无限序列模一不规则性的定量指标。1986年,Proinov为所有p>1的无限序列在d维单位立方体中给出了L_p不均衡性的下界,但直到最近才有人质疑这个下界是否在数量级上最优。2014年,Dick和Pillichshhammer给出了一个无限序列,其L_2不均衡性的顺序与Proinov的下界相匹配。本文则为所有有限p>1的情况给出了该问题的完整解决方案。我们考虑所谓的阶数2的数字(t,d)-序列,证明此类序列在所有p∈(1,∞)的情况下均达到L_p不均衡性的最优顺序。

英文摘要:

The $L_p$-discrepancy is a quantitative measure for the irregularity of distribution modulo one of infinite sequences. In 1986 Proinov proved for all $p>1$ a lower bound for the $L_p$-discrepancy of general infinite sequences in the $d$-dimensional unit cube, but it remained an open question whether this lower bound is best possible in the order of magnitude until recently. In 2014 Dick and Pillichshammer gave a first construction of an infinite sequence whose order of $L_2$-discrepancy matches the lower bound of Proinov. Here we give a complete solution to this problem for all finite $p > 1$. We consider so-called order $2$ digital $(t,d)$-sequences over the finite field with two elements and show that such sequences achieve the optimal order of $L_p$-discrepancy simultaneously for all $p \in (1,\infty)$.

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

↑