Beyond the Borsuk-Ulam theorem: The topological tverberg story

28Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bárány’s "topological Tverberg conjecture” from 1976 states that any continuous map of an N-simplex ΔN to Rd, for N ≥ (d + 1)(r - 1), maps points from r disjoint faces in ΔN to the same point in Rd. The proof of this result for the case when r is a prime, as well as some colored version of the same result, using the results of Borsuk-Ulam and Dold on the non-existence of equivariant maps between spaces with a free group action, were main topics of Matoušek’s 2003 book "Using the Borsuk-Ulam theorem.” In this paper we show how advanced equivariant topology methods allow one to go beyond the prime case of the topological Tverberg conjecture. First we explain in detail how equivariant cohomology tools (employing the Borel construction, comparison of Serre spectral sequences, Fadell-Husseini index, etc.) can be used to prove the topological Tverberg conjecture whenever r is a prime power. Our presentation includes a number of improved proofs as well as new results, such as a complete determination of the Fadell-Husseini index of chessboard complexes in the prime case. Then, we introduce the "constraint method,” which applied to suitable "unavoidable complexes” yields a great variety of variations and corollaries to the topological Tverberg theorem, such as the "colored” and the "dimension-restricted” (Van Kampen-Flores type) versions. Both parts have provided crucial components to the recent spectacular counter-examples in high dimensions for the case when r is not a prime power.

Cite

CITATION STYLE

APA

Blagojević, P. V. M., & Ziegler, G. M. (2017). Beyond the Borsuk-Ulam theorem: The topological tverberg story. In A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp. 273–341). Springer International Publishing. https://doi.org/10.1007/978-3-319-44479-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free