相关论文: A user's guide to the topological Tverberg conject…

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 prove (Theorem 2.4) that the symmetrized deleted join $SymmDelJoin(\mathcal{K})$ of a "balanced family" $\mathcal{K} = \langle K_i\rangle_{i=1}^r$ of collectively $r$-unavoidable subcomplexes of $2^{[m]}$ is $(m-r-1)$-connected. As a…

In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

We prove a Tverberg type theorem: Given a set $A \subset \mathbb{R}^d$ in general position with $|A|=(r-1)(d+1)+1$ and $k\in \{0,1,\ldots,r-1\}$, there is a partition of $A$ into $r$ sets $A_1,\ldots,A_r$ with the following property. The…

Let $P_1, P_2,\ldots, P_{d+1}$ be pairwise disjoint $n$-element point sets in general position in $d$-space. It is shown that there exist a point $O$ and suitable subsets $Q_i\subseteq P_i \; (i=1, 2, \ldots, d+1)$ such that $|Q_i|\geq…

We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…

We present a motivated exposition of the proof of the following Tverberg Theorem: For every integers $d,r$ any $(d+1)(r-1)+1$ points in $\mathbb R^d$ can be decomposed into $r$ groups such that all the $r$ convex hulls of the groups have a…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

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.

Recent progress building on the groundbreaking work of Mabillard and Wagner has shown that there are important differences between the affine and continuous theory for Tverberg-type results. These results aim to describe the intersection…

As we known, the {\it Seifert-Van Kampen theorem} handles fundamental groups of those topological spaces $X=U\cup V$ for open subsets $U, V\subset X$ such that $U\cap V$ is arcwise connected. In this paper, this theorem is generalized to…

The purpose of this note is to attract attention to the following conjecture (metastable $r$-fold Whitney trick) by clarifying its status as not having a complete proof, in the sense described in the paper. Assume that…

Let $T(d,r) = (r-1)(d+1)+1$ be the parameter in Tverberg's theorem, and call a partition $\mathcal I$ of $\{1,2,\ldots,T(d,r)\}$ into $r$ parts a "Tverberg type". We say that $\mathcal I$ "occurs" in an ordered point sequence $P$ if $P$…

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

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…

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset $S \subset \mathbb{R}^d$ and the intersection of convex hulls is required to have a non-empty…

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…