A Generalisation of Tverberg's Theorem
نویسندگان
چکیده
The well know theorem of Tverberg states that if n ≥ (d+1)(r − 1)+1 then one can partition any set of n points in R to r disjoint subsets whose convex hulls have a common point. The numbers T (d, r) = (d + 1)(r − 1) + 1 are known as Tverberg numbers. Reay asks the following question: if we add an additional parameter k (2 ≤ k ≤ r) what is the minimal number of points we need in order to guarantee that there exists an r partition of them such that any k of the r convex hulls intersect. This minimal number is denoted by T (d, r, k). Reay conjectured that T (d, r, k) = T (d, r) for all d, r and k. In this article we prove that this is true for the following cases: when k ≥ [ d+3 2 ] or when d < rk r−k − 1 and for the specific values d = 3, r = 4, k = 2 and d = 5, r = 3, k = 2.
منابع مشابه
Tverberg's theorem with constraints
We extend the topological Tverberg theorem in the following way: Pairs of points are forced to end up in different partition blocks. This leads to the concept of constraint graphs. In Tverberg’s theorem with constraints, we come up with a list of constraints graphs for the topological Tverberg theorem. The proof is based on connectivity results of chessboard-type complexes. Tverberg’s theorem w...
متن کاملScribe: Thành Nguyen
In this lecture note, we describe some properties of convex sets and their connection with a more general model in topological spaces. In particular, we discuss Tverberg's theorem, Borsuk's conjecture and related problems. First we give some basic properties of convex sets in R d. a i is also in S. Definition 2. Convex hull of a set A, denoted by conv(A), is the set of all convex combination of...
متن کاملAlgorithmic aspects of Tverberg's Theorem
We study the complexity of finding Tverberg partitions within various convexity spaces. For the classic geometric version of Tverberg’s theorem, we obtain probabilistic algorithms that are weakly polynomial in both the dimension and the number of points. These algorithms extend to other variations, such as the integer version of Tverberg’s theorem. For geodetic convexity on graphs, we show that...
متن کاملA Colored Version of Tverberg's Theorem
The main result of this paper is that given r red, r white, and r green points in the plane, it is possible to form r vertex-disjoint triangles Aj,...,Ar in such a way that A, has one red, one white, and one green vertex for every / = l , . . . , r and the intersection of these triangles is non-empty.
متن کاملCenterpoints and Tverberg's technique
Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg’s theorem, we show the following extension of the centerpoint theorem: given any set P of n points in the plane, and a parameter 1/3 ≤ c ≤ 1, one can always find a disk D such that any closed half-space containing D contains at least cn points of P , and furthermore, D contains at most ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 47 شماره
صفحات -
تاریخ انتشار 2012