Related papers: Low-discrepancy point sets for non-uniform measure…
We study here the error of numerical integration on metric measure spaces adapted to a decomposition of the space into disjoint subsets. We consider both the error for a single given function, and the worst case error for all functions in a…
We give a simple conceptual proof of the consistency of a test for multivariate uniformity in a bounded set $K \subset \mathbb{R}^d$ that is based on the maximal spacing generated by i.i.d. points $X_1, \ldots,X_n$ in $K$, i.e., the volume…
It is well-known that entire functions whose spectrum belongs to a fixed bounded set $S$ admit real uniformly discrete uniqueness sets $\Lambda$. We show that the same is true for much wider spaces of continuous functions. In particular,…
We show that for all $A, B \subseteq \{0,1,2\}^{d}$ we have $$ |A+B|\geq (|A||B|)^{\log(5)/(2\log(3))}. $$ We also show that for all finite $A,B \subset \mathbb{Z}^{d}$, and any $V \subseteq\{0,1\}^{d}$ the inequality $$ |A+B+V|\geq…
A sign-linear one bit map from the $ d$-dimensional sphere $ \mathbb S ^{d}$ to the $ n$-dimensional Hamming cube $ H^n= \{ -1, +1\} ^{n}$ is given by $$ x \to \{ \mbox{sign} (x \cdot z_j) \;:\; 1\leq j \leq n\} $$ where $ \{z_j\} \subset…
The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…
Early results by Borel and Cantelli and Erd\H{o}s and Chung have provided bounds for the measure of a limsup set in terms of measures of its constituent sets and their intersections. Recent work by Beresnevich and Velani \cite{Velanipaper}…
Stolarsky's invariance principle quantifies the deviation of a subset of a metric space from the uniform distribution. Classically derived for spherical sets, it has been recently studied in a number of other situations, revealing a general…
The construction of low-discrepancy sets, used for uniform sampling and numerical integration, has recently seen great improvements based on optimization and machine learning techniques. However, these methods are computationally expensive,…
This paper is devoted to the study of a discrepancy-type characteristic -- the fixed volume discrepancy -- of the Fibonacci point set in the unit square. It was observed recently that this new characteristic allows us to obtain optimal rate…
We present an explicit construction of infinite sequences of points $(\boldsymbol{x}_0,\boldsymbol{x}_1, \boldsymbol{x}_2, \ldots)$ in the $d$-dimensional unit-cube whose periodic $L_2$-discrepancy satisfies $$L_{2,N}^{{\rm…
We study the variance in the number of points contained within a window $\Omega$ of arbitrary size, and to further illuminate our understanding of {\it hyperuniform} systems, i.e., point patterns that do not possess long-wavelength…
This paper characterizes the maximum mean discrepancies (MMD) that metrize the weak convergence of probability measures for a wide class of kernels. More precisely, we prove that, on a locally compact, non-compact, Hausdorff space, the MMD…
We study the lower bound for Koldobsky's slicing inequality. We show that there exists a measure $\mu$ and a symmetric convex body $K \subseteq \mathbb{R}^n$, such that for all $\xi\in S^{n-1}$ and all $t\in \mathbb{R},$…
Let $(n_k)_{k=1}^{\infty}$ be a lacunary sequence of integers. We show that if $\mu$ is a probability measure on $[0,1)$ such that $|\widehat{\mu}(t)|\leq c|t|^{-\eta}$, then for $\mu$-almost all $x$, the discrepancy $D_N(n_kx)$ satisfies…
The choice of a point set, to be used in numerical integration, determines, to a large extent, the error estimate of the integral. Point sets can be characterized by their discrepancy, which is a measure of its non-uniformity. Point sets…
Following a result of D.~Bylik and M.T.~Lacey from 2008 it is known that there exists an absolute constant $\eta>0$ such that the (unnormalized) $L^{\infty}$-norm of the three-dimensional discrepancy function, i.e, the (unnormalized) star…
In this book chapter we survey known approaches and algorithms to compute discrepancy measures of point sets. After providing an introduction which puts the calculation of discrepancy measures in a more general context, we focus on the…
The Brunn-Minkowski Theorem asserts that $\mu_d(A+B)^{1/d}\geq \mu_d(A)^{1/d}+\mu_d(B)^{1/d}$ for convex bodies $A,\,B\subseteq \R^d$, where $\mu_d$ denotes the $d$-dimensional Lebesgue measure. It is well-known that equality holds if and…
A great challenge in the analysis of the discrepancy function D_N is to obtain universal lower bounds on the L-infty norm of D_N in dimensions d \geq 3. It follows from the average case bound of Klaus Roth that the L-infty norm of D_N is at…