Related papers: A characterization theorem for the $L^{2}$-discrep…

Van der Corput's provides the sharp bound vol(C) \le m 2^d on the volume of a d-dimensional origin-symmetric convex body C that has 2m-1 points of the integer lattice in its interior. For m=1, a characterization of the equality case vol(C)=…

We consider a unitary representation of the Dihedral group $D_{2n}% =\mathbb{Z}_{n}\rtimes\mathbb{Z}_{2}$ obtained by inducing the trivial character from the co-normal subgroup $\left\{0\right\}\rtimes\mathbb{Z}_{2}.$ This representation is…

A comparison theorem by Choe, Ghomi and Ritor\'e states that the exterior isoperimetric profile $I_\mathcal{C}$ of any convex body $\mathcal{C}$ in $\mathbb{R}^N$ lies above that of any half-space $H$. We characterize convex bodies such…

Various methods of summation for divergent series of real numbers have been generalized to analogous results for sums of iid random variables. The natural extension of results corresponding to Ces\`aro summation amounts to proving almost…

For $m, d \in {\mathbb N}$, a jittered sampling point set $P$ having $N = m^d$ points in $[0,1)^d$ is constructed by partitioning the unit cube $[0,1)^d$ into $m^d$ axis-aligned cubes of equal size and then placing one point independently…

This note establishes convergence in mean of order $p$, $0<p\le 1$ for $d$-dimensional arrays of random vectors in Hilbert spaces under the Ces\`{a}ro uniform integrability conditions. In the case where $0<p<1$, our $L_p$ convergence is…

In 2001 Heinrich, Novak, Wasilkowski and Wo\'zniakowski proved that the inverse of the star discrepancy satisfies $n(d,\varepsilon)\leq c_{\abs}d \varepsilon^{-2}$ by showing that there exists a set of points in $[0,1)^d$ whose…

Let L be a compact convex set in R^n, and let 1 <= d <= n-1. The set L is defined to be d-decomposable if L is a direct Minkowski sum (affine Cartesian product) of two or more convex bodies each of dimension at most d. A compact convex set…

For $m, d \in \mathbb{N}$, a jittered sample of $N=m^d$ points can be constructed by partitioning $[0,1]^d$ into $m^d$ axis-aligned equivolume boxes and placing one point independently and uniformly at random inside each box. We utilise a…

We study the error of the number of points of the lattice $\mathbb{Z}^{d}$ that fall into a dilated and translated hypercube centred around $0$ and whose axis are parallel to the axis of coordinates. We show that if $t$, the factor of…

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…

Points in the unit cube with low discrepancy can be constructed using algebra or, more recently, by direct computational optimization of a criterion. The usual $L_\infty$ star discrepancy is a poor criterion for this because it is…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

In 1960, Gr\"{u}nbaum proved that for any convex body $C\subset\mathbb{R}^d$ and every halfspace $H$ containing the centroid of $C$, one has that the volume of $H\cap C$ is at least a $\frac{1}{e}$-fraction of the volume of $C$. Recently,…

The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…

We prove that the information complexity (i.e., the inverse) of the classical spherical cap $L_2$ discrepancy on the $d$-dimensional sphere $\mathbb{S}^d$ decreases with dimension $d$, indicating a ``blessing of dimensionality'' for the…

The discrepancy between two independent samples \(X_1,\dots,X_n\) and \(Y_1,\dots,Y_n\) drawn from the same distribution on $\mathbb{R}^d$ typically has order \(O(\sqrt{n})\) even in one dimension. We give a simple online algorithm that…

Let $A \in \mathbb{R}^{n \times (n - d)}$ be a random matrix with independent uniformly anti-concentrated entries satisfying $\mathbb{E}\lvert A\rvert_{HS}^2 \leq Kn(n-d)$ and let $H$ be the subspace spanned by the columns of $A$. Let $X…

We study the $L^{\infty}$ discrepancy of point sets generated by determinantal point processes on all compact, connected two-point homogeneous spaces, namely spheres and projective spaces. Using concentration inequalities and variance…

An operator C on a Hilbert space H dilates to an operator T on a Hilbert space K if there is an isometry V from H to K such that C=V^*TV. A main result of this paper is, for a positive integer d, the simultaneous dilation, up to a sharp…