Topology of unavoidable complexes
Abstract
The partition number π(K) of a simplicial complex K⊂ 2[m] is the minimum integer such that for each partition A1… A = [m] of [m] at least one of the sets Ai is in K. A complex K is r-unavoidable if π(K)≤ r. We say that a complex K is globally r-non-embeddable in Rd if for each continuous map f: | K| → Rd there exist r vertex disjoint faces σ1,…, σr of | K| such that f(σ1)… f(σr)≠. Motivated by the problems of Tverberg-Van Kampen-Flores type we prove several results (Theorems 3.6, 3.9, 4.6) which link together the combinatorics and topology of these two classes of complexes. One of our central observations (Theorem 4.6), summarizing and extending results of G. Schild, B. Gr\"unbaum and many others, is that interesting examples of (globally) r-non-embeddable complexes can be found among the joins K = K1… Ks of r-unavoidable complexes.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.