The weighted \(b\)-adic diaphony (Q2507588)

Let \(s\geq 1\) be a fixed integer and \((x_{n)n \geq 0}\) an arbitrary sequence of points in the \(s\)-dimensional unit cube \([0, 1)^s\). Uniformly distributed sequences (UDS) are considered for \([0, 1)^s\), and the main purpose of this paper is to investigate numerical measures for the irregularity, including discrepancy and diaphony properties, of UDS. Within the quantitative theory of UDS, the author introduces a new numerical measure for UDS in \([0, 1)^s\) called weighted \(b\)-adic diaphony, \(b\geq 2\) an arbitrary fixed integer. He proves that the computing complexity of the weighted \(b\)-adic diaphony of an arbitrary net, composed of \(N\) points in \([0, 1)^s\), is \(O(sN^2)\). Well-known kinds of diaphony are obtained as particular cases of the (more general) weighted \(b\)-adic diaphony. Since in many applications high-dimensional are needed well-distributed point nets, and inspired by the already existing notions of limiting discrepancy and limiting dyadic diaphony, the author introduces the concept of limiting weighted \(b\)-adic diaphony, based on the Walsh functional system over finite groups as a characteristic of the net behaviour in \([0, 1)^s\). A general lower bound of the limiting weighted \(b\)-adic diaphony of an arbitrary \(N\)-point net in \([0, 1)^\infty\) is proved. Another achieved result is based on the newly defined notion of weighted Hilbert space, and the relationship pointed out between weighted \(b\)-adic diaphony and the worst-case error of the integration of the weighted Hilbert space with respect to an arbitrary point net.