Related papers: Low Discrepancy Digital Kronecker-Van der Corput S…
As it follows from the theory of almost periodic functions the set of integer solutions $q$ to the Kronecker system $|\omega_{j} q - \theta_{j}| < \varepsilon \pmod 1$, $j=1,\ldots,m$, where $1,\omega_{1},\ldots,\omega_{m}$ are linearly…
Many problems in computer science and applied mathematics require rounding a vector $\mathbf{w}$ of fractional values lying in the interval $[0,1]$ to a binary vector $\mathbf{x}$ so that, for a given matrix $\mathbf{A}$,…
Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Following a century of research on the topic, it is still unclear…
We initiate the study of quadratic discrepancy for finite point sets on the Heisenberg group $\mathbb H^n$ with respect to upper Ahlfors regular probability measures. For a natural family of test sets given by left translations and…
Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…
In 1975 Walter Philipp proved the law of the iterated logarithm (LIL) for the discrepancy of lacunary sequences: for any sequence $(n_k)_{k \geq 1}$ satisfying the Hadamard gap condition $n_{k+1} / n_k \geq q > 1,~k \geq 1,$ we have $$…
This paper defines the notion of class discrepancy for families of functions. It shows that low discrepancy classes admit small offline and streaming coresets. We provide general techniques for bounding the class discrepancy of machine…
The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper…
The $LS$-sequences are a parametric family of sequences of points in the unit interval. They were introduced by Carbone, who also proved that under an appropriate choice of the parameters $L$ and $S$, such sequences are low-discrepancy. The…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…
In this paper, we revisit the old problem of compact finite difference approximations of the homogeneous Dirichlet problem in dimension 1. We design a large and natural set of schemes of arbitrary high order, and we equip this set with an…
A test of uniformity on [0,1] is developed for the setting of a single observation recorded with sufficient precision. Although consistency against general alternatives is not attainable with only one draw in the classical large-sample…
Deterministically generating near-uniform point samplings of the motion groups like SO(3), SE(3) and their n-wise products SO(3)^n, SE(3)^n is fundamental to numerous applications in computational and data sciences. The natural measure of…
In this short note we report on a coincidence of two mathematical quantities that, at first glance, have little to do with each other. On the one hand, there are the Lebesgue constants of the Walsh function system that play an important…
We show that the $\mathcal{L}_2$ discrepancy of the explicitly constructed infinite sequences of points $(\boldsymbol{x}_0,\boldsymbol{x}_1, \boldsymbol{x}_2,...)$ in $[0,1)^s$ over $\mathbb{F}_2$ introduced in [J. Dick, Walsh spaces…
Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences…
We prove an easy statement about inhomogeneous approximation in metric theory of Diophantine Approximation.
Recalling recent results on the characterization of threshold-based sampling as quasi-isometric mapping, mathematical implications on the metric and topological structure of the space of event sequences are derived. In this context, the…
Quasi-Monte Carlo methods are a way of improving the efficiency of Monte Carlo methods. Digital nets and sequences are one of the low discrepancy point sets used in quasi-Monte Carlo methods. This thesis presents the three new results…
For a tuple $(\theta_1,..,\theta_M)$ of complex number, buliding on the approximation techniques in earlier papers of this series, this paper engages in deducing lower estimates on the transcendence degree of the field generated by…