skip to content

Construction of high-dimensional point sets with small dispersion

Presented by: 
Mario Ullrich
Monday 18th February 2019 - 15:30 to 16:05
INI Seminar Room 1
Based on deep results from coding theory, we present an deterministic algorithm that contructs a point set with dispersion at most $\eps$ in dimension $d$ of size $poly(1/\eps)*\log(d)$, which is optimal with respect to the dependence on $d$. The running time of the algorithms is, although super-exponential in $1/\eps$, only polynomial in $d$.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons