Pablo Soberón

Blocking codimension-one simplices on the moment curve

We study $b_d(n)$, the minimum number of points needed to meet the relative interior of every $(d-1)$-simplex spanned by an $n$-point set in general position in $\mathbb{R}^d$. In the plane, this is the parameter from the Blocking Conjecture. We improve the best known general planar lower bound to $ b_2(n)\ge \frac{41}...