L_p- and S_(p,q)^rB-discrepancy of (order 2) digital nets
classification
🧮 math.NA
math.AG
keywords
netsdigitaldiscrepancyorderboundsoptimalrangesatisfy
read the original 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_p^r H$-discrepancy is considered as well.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.