Lower bounds on the $L_p$ discrepancy of digital NUT sequences

preprint2019arXivOpen access

We study the $L_p$ discrepancy of digital NUT sequences which are an important sub-class of digital $(0,1)$ -sequences in the sense of Niederreiter. The main result is a lower bound for certain sub-classes of digital NUT sequences.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Lower bounds on the $L_p$ discrepancy of digital NUT sequences

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Lower bounds on the LpL_pLp​ discrepancy of digital NUT sequences

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Lower bounds on the $L_p$ discrepancy of digital NUT sequences