no code implementations • 25 Feb 2021 • Boris Bukh, Ting-Wei Chao
Digital nets (in base $2$) are the subsets of $[0, 1]^d$ that contain the expected number of points in every not-too-small dyadic box.
Combinatorics Computational Geometry
no code implementations • 16 Mar 2018 • Boris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager
We consider incidences among colored sets of lines in $\mathbb{R}^d$ and examine whether the existence of certain concurrences between lines of $k$ colors force the existence of at least one concurrence between lines of $k+1$ colors.