A note on minimal dispersion of point sets in the unit cube

@article{Sosnovec2017ANO,
  title={A note on minimal dispersion of point sets in the unit cube},
  author={Jakub Sosnovec},
  journal={Eur. J. Comb.},
  year={2017},
  volume={69},
  pages={255-259}
}

The minimal k-dispersion of point sets in high dimensions

Empty axis-parallel boxes

We show that, for every set of $n$ points in the $d$-dimensional unit cube, there is an empty axis-parallel box of volume at least $\Omega(d/n)$ as $n\to\infty$ and $d$ is fixed. In the opposite

An Upper Bound of the Minimal Dispersion via Delta Covers

It is proved that there is a point set, such that the largest volume of such a test set without any point is bounded above by \(\frac {\log \vert \varGamma _\delta \vert }{n} + \delta}\).

On the dispersion of sparse grids

  • David Krieg
  • Computer Science, Mathematics
    J. Complex.
  • 2018

Minimal dispersion of large volume boxes in the cube

An upper bound on the minimal dispersion

N A ] 3 0 O ct 2 01 7 Fixed volume discrepancy in the periodic case

Discrepancy theory is a classical well established area of research in geometry and numerical integration (see [2], [8], [15], [17]). Recently, in [18], a new phenomenon has been discovered. A

Improved dispersion bounds for modified Fibonacci lattices

Piercing All Translates of a Set of Axis-Parallel Rectangles

This work requires that a single point set P simultaneously pierces each translate of each shape from some family F, and denotes the lowest possible density of such an F-piercing point set by πT (F).

References

SHOWING 1-10 OF 16 REFERENCES

On the size of the largest empty box amidst a point set

An Upper Bound of the Minimal Dispersion via Delta Covers

It is proved that there is a point set, such that the largest volume of such a test set without any point is bounded above by \(\frac {\log \vert \varGamma _\delta \vert }{n} + \delta}\).

On the Largest Empty Axis-Parallel Box Amidst n Points

We give the first efficient (1−ε)-approximation algorithm for the following problem: Given an axis-parallel d-dimensional box R in ℝd containing n points, compute a maximum-volume empty

Computing the Largest Empty Rectangle

A divide-and-conquer approach similar to the ones used by Strong and Bentley is used and a new notion of Voronoi diagram is introduced along with a method for efficient computation of certain functions over paths of a tree.

Tractability of the Approximation of High-Dimensional Rank One Tensors

It is proved that for certain parameters (smoothness and norm of the $$r$$rth derivative), this problem is intractable, while for other parameters, the problem is tractable and the complexity is only polynomial in the dimension for every fixed $$\varepsilon >0$$ε>0.

Quasi-Monte-Carlo methods and the dispersion of point sequences

On the maximum empty rectangle problem

Number Theory, Fourier Analysis and Geometric Discrepancy

Part I. Elementary Number Theory: 1. Prelude 2. Arithmetic functions and integer points 3. Congruences 4. Quadratic reciprocity and Fourier series 5. Sums of squares Part II. Fourier Analysis and

The Marcinkiewicz-Type Discretization Theorems

  • V. Temlyakov
  • Mathematics, Computer Science
    Constructive Approximation
  • 2018
A new technique is presented, which works well for discretization of the integral norm, which is a combination of probabilistic technique, based on chaining, and results on the entropy numbers in the uniform norm.

Approximating Integrals Via Monte Carlo and Deterministic Methods

This book is designed to introduce graduate students and researchers to the primary methods useful for approximating integrals, and although the focus is on higher- dimensional integrals the lower-dimensional case is also covered.