scholarly journals Radon Numbers Grow Linearly

Author(s):  
Dömötör Pálvölgyi

AbstractDefine the k-th Radon number $$r_k$$ r k of a convexity space as the smallest number (if it exists) for which any set of $$r_k$$ r k points can be partitioned into k parts whose convex hulls intersect. Combining the recent abstract fractional Helly theorem of Holmsen and Lee with earlier methods of Bukh, we prove that $$r_k$$ r k grows linearly, i.e., $$r_k\le c(r_2)\cdot k$$ r k ≤ c ( r 2 ) · k .

2021 ◽  
Vol 9 ◽  
Author(s):  
Joseph Malkoun ◽  
Peter J. Olver

Abstract Given n distinct points $\mathbf {x}_1, \ldots , \mathbf {x}_n$ in $\mathbb {R}^d$ , let K denote their convex hull, which we assume to be d-dimensional, and $B = \partial K $ its $(d-1)$ -dimensional boundary. We construct an explicit, easily computable one-parameter family of continuous maps $\mathbf {f}_{\varepsilon } \colon \mathbb {S}^{d-1} \to K$ which, for $\varepsilon> 0$ , are defined on the $(d-1)$ -dimensional sphere, and whose images $\mathbf {f}_{\varepsilon }({\mathbb {S}^{d-1}})$ are codimension $1$ submanifolds contained in the interior of K. Moreover, as the parameter $\varepsilon $ goes to $0^+$ , the images $\mathbf {f}_{\varepsilon } ({\mathbb {S}^{d-1}})$ converge, as sets, to the boundary B of the convex hull. We prove this theorem using techniques from convex geometry of (spherical) polytopes and set-valued homology. We further establish an interesting relationship with the Gauss map of the polytope B, appropriately defined. Several computer plots illustrating these results are included.


Algorithmica ◽  
1991 ◽  
Vol 6 (1-6) ◽  
pp. 533-553 ◽  
Author(s):  
Chanderjit Bajaj ◽  
Myung -Soo Kim

2010 ◽  
Vol 124 (1-2) ◽  
pp. 33-43 ◽  
Author(s):  
Kurt M. Anstreicher ◽  
Samuel Burer

1977 ◽  
Vol 20 (2) ◽  
pp. 87-93 ◽  
Author(s):  
F. P. Preparata ◽  
S. J. Hong

Sign in / Sign up

Export Citation Format

Share Document