Optimal periodic L_2-discrepancy and diaphony bounds for higher order digital sequences

12/12/2022
by   Friedrich Pillichshammer, et al.
0

We present an explicit construction of infinite sequences of points (x_0,x_1, x_2, …) in the d-dimensional unit-cube whose periodic L_2-discrepancy satisfies L_2,N^ per({x_0,x_1,…, x_N-1}) ≤ C_d N^-1 (log N)^d/2 N ≥ 2, where the factor C_d > 0 depends only on the dimension d. The construction is based on higher order digital sequences as introduced by J. Dick in the year 2008. The result is best possible in the order of magnitude in N according to a Roth-type lower bound shown first by P.D. Proinov. Since the periodic L_2-discrepancy is equivalent to P. Zinterhof's diaphony the result also applies to this alternative quantitative measure for the irregularity of distribution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2020

A note on the periodic L_2-discrepancy of Korobov's p-sets

We study the periodic L_2-discrepancy of point sets in the d-dimensional...
research
06/24/2020

Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays

We consider the problem of digitalizing Euclidean segments. Specifically...
research
03/29/2021

A Sharp Discrepancy Bound for Jittered Sampling

For m, d ∈ℕ, a jittered sampling point set P having N = m^d points in [0...
research
12/04/2021

Fast Electromagnetic Validations of Large-Scale Digital Coding Metasurfaces Accelerated by Recurrence Rebuild and Retrieval Method

The recurrence rebuild and retrieval method (R3M) is proposed in this pa...
research
05/04/2020

Investigating the discrepancy property of de Bruijn sequences

The discrepancy of a binary string refers to the maximum (absolute) diff...
research
03/19/2018

On recovery of sequences from subsequences: the case of non-periodic spectrum gaps

The paper investigates recoverability of sequences from their periodic s...
research
10/20/2022

Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

We study divide-and-conquer recurrences of the form f(n) = α ...

Please sign up or login with your details

Forgot password? Click here to reset