Related papers: Tverberg-type theorems for intersecting by rays
Tverberg's theorem states that for any $k \ge 2$ and any set $P \subset \mathbb{R}^d$ of at least $(d + 1)(k - 1) + 1$ points in $d$ dimensions, we can partition $P$ into $k$ subsets whose convex hulls have a non-empty intersection. The…
The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d 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…
We give a new proof Tverberg's famous theorem: For every set $X \subset \R^d$ with $|X|=(r-1)(d+1)+1$, there is a partition of $X$ into $r$ sets $X_1,\ldots,X_r$ such that $\bigcap_{p=1}^r \conv X_p\ne \emptyset$. The new proof uses linear…
We prove a Tverberg-type theorem using the probabilistic method. Given $\varepsilon >0$, we find the smallest number of partitions of a set $X$ in $R^d$ into $r$ parts needed in order to induce at least one Tverberg partition on every…
The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q-1)-simplex to R}^d, there are q disjoint faces F_i of the simplex whose images intersect. It is possible to put conditions on which pairs…
Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…
A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…
We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the…
A set partition is $c$-uniform if every block has size $c$. Two families of $c$-uniform partitions of a finite set are said to be cross $t$-intersecting if two partitions from different families share at least $t$ blocks. In this paper, we…
The topological Tverberg theorem states that any continuous map of a $(d+1)(r-1)$-simplex into the Euclidean $d$-space maps some points from $r$ pairwise disjoint faces of the simplex to the same point whenever $r$ is a prime power. We…
In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…
In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…
For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…
This paper presents a new variation of Tverberg's theorem. Given a discrete set $S$ of $R^d$, we study the number of points of $S$ needed to guarantee the existence of an $m$-partition of the points such that the intersection of the $m$…
The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…
We prove an intersection formula for two plane branches in terms of their semigroups and key polynomials. Then we provide a strong version of Bayer's theorem on the set of intersection numbers of two branches and apply it to the logarithmic…
In this paper a generalized topological central point theorem is proved for maps of a simplex to finite-dimensional metric spaces. Similar generalizations of the Tverberg theorem are considered.
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
Recently, Adiprasito et al. have initiated the study of the so-called no-dimensional Tverberg problem. This problem can be informally stated as follows: Given $n\geq k$, partition an $n$-point set in Euclidean space into $k$ parts such that…
This is a survey on an analogue of tropical convexity developed over the max-min semiring, starting with the descriptions of max-min segments, semispaces, hyperplanes and an account of separation and non-separation results based on…