Radon partitions in convexity spaces

Details Radon partitions in convexity spaces Radon partitions in convexity spaces

2010-09-13

arxiv.org/abs/1009.2384v1

Mathematics

Combinatorics

11 pages

Scientific paper

Tverberg's theorem asserts that every (k-1)(d+1)+1 points in R^d can be partitioned into k parts, so that the convex hulls of the parts have a common intersection. Calder and Eckhoff asked whether there is a purely combinatorial deduction of Tverberg's theorem from the special case k=2. We dash the hopes of a purely combinatorial deduction, but show that the case k=2 does imply that every set of O(k^2 log^2 k) points admits a Tverberg partition into k parts.

Affiliated with

Also associated with

No associations

Rating

Radon partitions in convexity spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Radon partitions in convexity spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Radon partitions in convexity spaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337661