research
∙
11/10/2021
Applications of Random Algebraic Constructions to Hardness of Approximation
In this paper, we show how one may (efficiently) construct two types of ...
share
research
∙
02/25/2021
Digital almost nets
Digital nets (in base 2) are the subsets of [0,1]^d that contain the exp...
research
∙
09/12/2020
Empty axis-parallel boxes
We show that, for every set of n points in the d-dimensional unit cube, ...
research
∙
07/17/2020
On convex holes in d-dimensional point sets
Given a finite set A ⊆ℝ^d, points a_1,a_2,…,a_ℓ∈ A form an ℓ-hole in A i...
research
∙
03/16/2018
Consistent sets of lines with no colorful incidence
We consider incidences among colored sets of lines in R^d and examine wh...
research
∙
03/08/2018
Nearly orthogonal vectors and small antipodal spherical codes
How can d+k vectors in R^d be arranged so that they are as close to orth...
research
∙
02/01/2018