Abstract
Dick proved that all order digital nets satisfy optimal upper bounds of the -discrepancy. We give an alternative proof for this fact using Haar bases. Furthermore, we prove that all digital nets satisfy optimal upper bounds of the -discrepancy for a certain parameter range and enlarge that range for order digitals nets. -, - and -discrepancy is considered as well.
Connections
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.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.