Fetching the paper…
Reading the bibliography…
We prove a no-dimensional version of Carath\'edory's theorem: given an $n$-element set $P\subset \Re^d$, a point $a \in \conv P$, and an integer $r\le d$, $r \le n$, there is a subset $Q\subset P$ of $r$ elements such that the distance between $a$ and $\conv Q$ is less than $\diam P/\sqrt {2r}$.
Nothing clear enough to list yet.
Nothing clear enough to list yet.
Nothing clear enough to list yet.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…