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 substantially generalize this theorem to continuous maps of certain CW complexes, including simplicial $((d+1)(r-1)-1)$-spheres, into the Euclidean $d$-space. We also discuss the atomicity of the Tverberg property.
The main result of this paper is a "colored Tverberg theorem for rainbow-unavoidable complexes". This theorem may be considered as a merging of two theorems: "Tverberg theorem for collectively unavoidable complexes" and "balanced colored Tverberg theorem". The main tool for the proof is discrete Morse theory.
We prove a "multiple colored Tverberg theorem" and a "balanced colored Tverberg theorem", by applying different methods, tools and ideas. The proof of the first theorem uses multiple chessboard complexes (as configuration spaces) and Eilenberg-Krasnoselskii theory of degrees of equivariant maps for non-free actions. The proof of the second result relies on high connectivity of the configuration space, established by discrete Morse theory.
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 pattern of convex hulls of point sets in Euclidean space and continuous relaxations thereof. Here we give additional examples of an affine-continuous divide, but our deductions are almost elementary and do not build on the technical work of Mabillard and Wagner. Moreover, these examples show a difference between the affine and continuous theory even asymptotic…
The type A colored Tverberg theorem of Blagojević, Matschke, and Ziegler provides optimal bounds for the colored Tverberg problem, under the condition that the number of intersecting rainbow simplices is a prime number. We extend this result to an optimal, type A colored Tverberg theorem for multisets of colored points, which is valid for each prime power $r=p^k$. One of the principal new ideas is to replace the ambient simplex $Δ^N$, used in the original Tverberg theorem, by an "abridged simplex" of smaller dimension, and to compensate for this reduction by allowing vertices to repeatedly app…
Bárány's "topological Tverberg conjecture" from 1976 states that any continuous map of an $N$-simplex $Δ_N$ to $\mathbb{R}^d$, for $N\ge(d+1)(r-1)$, maps points from $r$ disjoint faces in $Δ_N$ to the same point in $\mathbb{R}^d$. 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 meth…
In this paper, we investigate vector fields on polyhedral complexes and their associated trajectories. We study vector fields which are analogue of the gradient vector field of a function in the smooth case. Our goal is to define a nice theory of trajectories of such vector fields, so that the set of them captures the topology of the polyhedral complex, as in classical Morse theory. Since we do not assume the polyhedral complex to be a manifold, the definition of vector fields on it is very different from the smooth case. Nevertheless, we will show that there exist nice classes of functions an…
This paper studies Bernoulli cell complexes from the perspective of persistent homology, Tutte polynomials, and random-cluster models. Following the previous work [9], we first show the asymptotic order of the expected lifetime sum of the persistent homology for the Bernoulli cell complex process on the $\ell$-cubical lattice. Then, an explicit formula of the expected lifetime sum using the Tutte polynomial is derived. Furthermore, we study a higher dimensional generalization of the random-cluster model derived from the Edwards-Sokal type coupling, and show some basic results such as the posit…
We introduce the notion of smooth cell complexes and its subclass consisting of gathered cell complexes within the category of diffeological spaces (cf. Definitions 1 and 3). It is shown that the following hold. (1) With respect to the D-topology, every smooth cell complex is a topological cell complex (cf. Proposition 2). It is paracompact and Hausdorff if it is countable (cf. Proposition 8). (2) Every continuous map between gathered cell complexes is continuously homotopic to a smooth map (cf. Theorem 5). (3) Any topological cell complex is continuously homotopy equivalent to a gathered (hen…
We study the vector spaces and integer lattices of cuts and flows associated with an arbitrary finite CW complex, and their relationships to group invariants including the critical group of a complex. Our results extend to higher dimension the theory of cuts and flows in graphs, most notably the work of Bacher, de la Harpe and Nagnibeda. We construct explicit bases for the cut and flow spaces, interpret their coefficients topologically, and give sufficient conditions for them to be integral bases of the cut and flow lattices. Second, we determine the precise relationships between the discrimin…
Forman introduced discrete Morse theory as a tool for studying CW complexes by essentially collapsing them onto smaller, simpler-to-understand complexes of critical cells in [Fo]. Chari reformulated discrete Morse theory for regular cell complexes in terms of acyclic matchings on face posets in [Ch]. This paper addresses two questions: (1) under what conditions may several gradient paths in a discrete Morse function simultaneously be reversed to cancel several pairs of critical cells, to further collapse the complex, and (2) how to use lexicographically first reduced expressions for permutatio…
In the study of smooth functions on manifolds, min-max theory provides a mechanism for identifying critical values of a function. In this paper we introduce a discretized version of this theory associated to a discrete Morse function on a (regular) cell complex. As applications we prove a discrete version of the Mountain Pass Lemma and give an alternate proof of a discrete Lusternik-Schnirelmann Theorem.
Cone and constrained colorful Carathéodory Theorems
Freie Universität Berlin（柏林自由大学）；Mat. Institut SANU（塞尔维亚科学与艺术学院数学研究所）；Institute for Information Transmission Problems RAS（俄罗斯科学院信息传输问题研究所）；Moscow Institute of Physics and Technology（莫斯科物理技术学院）
We reformulate the inequalities among self-closeness numbers of spaces in cofibrations making use of homology dimension and show that the self-closeness number of a space is less than or equal to the homology dimension of the space. Then we prove a relation of self-closeness numbers and the connectivity for manifolds satisfying Poincaré duality. On the other hand we determine the self-closeness numbers of the real projective spaces, lens spaces and a cell complex defined by Mimura and Toda. Moreover, making use of the models of Sullivan and Quillen, we show several properties of self-closeness…
Combinatorial Complexes: Bridging the Gap Between Cell Complexes and Hypergraphs
University of San Francisco（旧金山大学）；University of South Florida（南佛罗里达大学）；The University of Manchester（曼彻斯特大学）；IBM Corporation（国际商业机器公司（IBM））；Imperial College London（伦敦帝国学院）；RWTH Aachen University（亚琛工业大学）
Let $X$ be a two-cell complex with attaching map $α\colon S^q\to S^p$, and let $C_X$ be the cofiber of the diagonal inclusion $X\to X\times X$. It is shown that the topological complexity (${\rm TC}$) of $X$ agrees with the Lusternik-Schnirelmann category (${\rm cat}$) of $C_X$ in the (almost stable) range $q\leq2p-1$. In addition, the equality ${\rm TC}(X)={\rm cat}(C_X)$ is proved in the (strict) metastable range $2p-1<q\leq3(p-1)$ under fairly mild conditions by making use of the Hopf invariant techniques recently developed by the authors in their study of the sectional category of arbitrar…
Rice University（莱斯大学）；RWTH Aachen University（亚琛工业大学）；Santa Clara University（圣克拉拉大学）
The processing of signals supported on non-Euclidean domains has attracted large interest recently. Thus far, such non-Euclidean domains have been abstracted primarily as graphs with signals supported on the nodes, though the processing of signals on more general structures such as simplicial complexes has also been considered. In this paper, we give an introduction to signal processing on (abstract) regular cell complexes, which provide a unifying framework encompassing graphs, simplicial complexes, cubical complexes and various meshes as special cases. We discuss how appropriate Hodge Laplac…
This paper introduces path triangulation of points in a bounded, simply connected surface region, replacing ordinary triangles in a Delaunay triangulation with path triangles from homotopy theory. A {\bf path triangle} has a border that is a sequence of paths $h:I\to X, I=[0,1]$. The main results in this paper are that (1) a cone $D\times I$ collapses to a path triangle $h\bigtriangleup K$, extending E.C. Zeeman's collapsible dunce hat cone theorem, (2) an ordinary path triangle with geometrically realized straight edges generalizes Veech's billiard triangle, (3) a billiard ball $K\times I$ co…
Santa Clara University（圣克拉拉大学）；University of South Florida（南佛罗里达大学）
Cell complexes are topological spaces constructed from simple blocks called cells. They generalize graphs, simplicial complexes, and polyhedral complexes that form important domains for practical applications. They also provide a combinatorial formalism that allows the inclusion of complicated relationships of restrictive structures such as graphs and meshes. In this paper, we propose \textbf{Cell Complexes Neural Networks (CXNs)}, a general, combinatorial and unifying construction for performing neural network-type computations on cell complexes. We introduce an inter-cellular message passing…
Stochastic Homology. Reduction Formulas for Computing Stochastic Betti Numbers of Maximal Random Complexes with Discrete Probabilities. Computation and Applications
Let $K$ be a finite simplicial, cubical, delta or CW complex. The persistence map $\mathrm{PH}$ takes a filter $f:K \rightarrow \mathbb{R}$ as input and returns the barcodes $\mathrm{PH}(f)$ of the associated sublevel set persistent homology modules. We address the inverse problem: given a target barcode $D$, computing the fiber $\mathrm{PH}^{-1}(D)$. For this, we use the fact that $\mathrm{PH}^{-1}(D)$ decomposes as complex of polyhedra when $K$ is a simplicial complex, and we generalise this result to arbitrary based chain complexes. We then design and implement a depth first search algorith…
Attending to Topological Spaces: The Cellular Transformer
Universitat de Barcelona（巴塞罗那大学）；Universidad de Salamanca（萨拉曼卡大学）；University of California Santa Barbara（加州大学圣巴巴拉分校）；Harvard University（哈佛大学）；Imperial College London（伦敦帝国学院）；University San Francisco（旧金山大学）
If $G$ has $4$-periodic cohomology, then D2 complexes over $G$ are determined up to polarised homotopy by their Euler characteristic if and only if $G$ has at most two one-dimensional quaternionic representations. We use this to solve Wall's D2 problem for several infinite families of non-abelian groups and, in these cases, also show that any finite Poincaré $3$-complex $X$ with $π_1(X)=G$ admits a cell structure with a single $3$-cell. The proof involves cancellation theorems for $\mathbb{Z} G$ modules where $G$ has periodic cohomology.
