Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Deterministic constructions of high-dimensional sets with small
  dispersion   The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest
box with sides parallel to the coordinate axes, which does not intersect $P$.
Here, we show a construction of low-dispersion point sets, which can be deduced
from solutions of certain $k$-restriction problems, which are well-known in
coding theory.
  It was observed only recently that, for any $\varepsilon>0$, certain
randomized constructions provide point sets with dispersion smaller than
$\varepsilon$ and number of elements growing only logarithmically in $d$. Based
on deep results from coding theory, we present explicit, deterministic
algorithms to construct such point sets in time that is only polynomial in $d$.
Note that, however, the running-time will be super-exponential in
$\varepsilon^{-1}$.

5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
25
The categories of this paper are: patt-sol
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
3
The categories of this paper are: physics
13
The categories of this paper are: quant-ph
11
The categories of this paper are: hep-lat
28
The categories of this paper are: alg-geom
19
The categories of this paper are: eess