Search Results for author:
Found 2 papers, 0 papers with code
Digital almost nets
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
Consistent sets of lines with no colorful incidence
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
