Papers
Topics
Authors
Recent
2000 character limit reached

L_p- and S_{p,q}^rB-discrepancy of (order 2) digital nets (1402.4424v4)

Published 18 Feb 2014 in math.NA and math.AG

Abstract: Dick proved that all order $2$ digital nets satisfy optimal upper bounds of the $L_2$-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 $S_{p,q}r B$-discrepancy for a certain parameter range and enlarge that range for order $2$ digitals nets. $L_p$-, $S_{p,q}r F$- and $S_pr H$-discrepancy is considered as well.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.