ﻻ يوجد ملخص باللغة العربية
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.
We give a characterization of all matrices $A,B,C in mathbb{F}_{2}^{m times m}$ which generate a $(0,m,3)$-net in base $2$ and a characterization of all matrices $B,Cinmathbb{F}_{2}^{mathbb{N}timesmathbb{N}}$ which generate a $(0,2)$-sequence in base $2$.
Digital nets (in base $2$) are the subsets of $[0,1]^d$ that contain the expected number of points in every not-too-small dyadic box. We construct sets that contain almost the expected number of points in every such box, but which are exponentially s
We observe long-range $^{85}$Rb and $^{87}$Rb (24$D$+5$S_{1/2}$) Rydberg molecules for eight different spin couplings, with binding energies up to 440~MHz and sub-percent relative uncertainty. Isotopic effects of the molecular binding energies arise
The goal of this paper is to investigate the missing part of the story about the relationship between the orthogonal polynomial ensembles and Painleve equations. Namely, we consider the $q$-Racah polynomial ensemble and show that the one-interval gap
New cross sections for the reaction $ep to eeta p$ are reported for total center of mass energy $W$=1.5--2.3 GeV and invariant squared momentum transfer $Q^2$=0.13--3.3 GeV$^2$. This large kinematic range allows extraction of new information about re