This paper offers an algorithmic solution to the problem of obtaining "economical" formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used for defining cohomology operations at the cochain level. As an example, we obtain explicit combinatorial descriptions of Steenrod k-th powers exclusively in terms of face operators.
We introduce a new invariant defined on the vertices of a given filtered simplicial complex, called codensity, which controls the impact of removing vertices on persistent homology. We achieve this control through the use of an interleaving type of distance between fitered simplicial complexes. We study the special case of Vietoris-Rips filtrations and show that our bounds offer a significant improvement over the immediate bounds coming from considerations related to the Gromov-Hausdorff distance. Based on these ideas we give an iterative method for the practical simplification of filtered sim…
In the 70:th, combinatorialists begun to systematically relate simplicial complexes and polynomial algebras, named Stanley-Reisner rings or face rings. This demanded an algebraization of the simplicial complexes, that turned the empty simplicial complex into a zero object w.r.t. to simplicial join, losing its former role as join-unit - a role taken over by a new (-1)-dimensional simplicial complex containing only the empty simplex. There can be no realization functor targeting the classical category of topological spaces that turns the contemporary simplicial join into topological join unless …
A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or Cech complex of a large data cloud. Thus, pre-processing the simplicial complex to get a smaller complex with the same homology groups and then applying the homology algorithm to the smaller one, has been an active research topic in the last years. In this survey, we discuss some recent papers that examine the complexity of this simplification via Discrete Mor…
We characterise integral Poincaré duality moment-angle complexes $\mathcal{Z}_{\mathcal{K}}$ in combinatorial terms of the Fan-Wang duality of the simplicial complex $\mathcal{K}$, and consequently in algebraic terms of the Gorenstein duality of the Stanley-Reisner ring $\mathbb{Z}[\mathcal{K}]$. We extend Poincaré duality results to certain polyhedral products using polyhedral join products of simplicial complexes.
We prove that certain conditions on multigraded Betti numbers of a simplicial complex $K$ imply existence of a higher Massey product in cohomology of a moment-angle-complex $\mathcal Z_K$, which contains a unique element (a strictly defined product). Using the simplicial multiwedge construction, we find a family $\mathcal{F}$ of polyhedral products being smooth closed manifolds such that for any $l,r\geq 2$ there exists an $l$-connected manifold $M\in\mathcal F$ with a nontrivial strictly defined $r$-fold Massey product in $H^{*}(M)$. As an application to homological algebra, we determine a wi…
In this paper we study the topological structure of moment-angle complexes $\mathcal{Z_K}$. We consider two classes of simplicial complexes. The first class $B_Δ$ consists of simplicial complexes $\mathcal{K}$ for which $\mathcal{Z_K}$ is homotopy equivalent to a wedge spheres. The second class $W_Δ$ consists of $\mathcal{K}\in B_Δ$ such that all spheres in the wedge are realized by iterated higher Whitehead products. Buchstaber and Panov asked if it is true that $B_Δ = W_Δ$. In this paper we show that this is not the case. Namely, we give an example of a simplicial complex whose corresponding…
This expository article is based on a lecture from the Stanford Symposium on Algebraic Topology: Application and New Directions, held in honor of Gunnar Carlsson, Ralph Cohen, and Ib Madsen.
It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of dimension 2, it is shown that boolean representable simplicial complexes have the homotopy type of a wedge of spheres of dimensions 1 and 2. Also in the case of dimension 2, necessary and sufficient conditions for shellability and being sequentially Cohen-Macaulay are determined. Complexity bounds are provided for all the algorithms involved.
We give a tool for understanding simplicial desuspension in A1-algebraic topology: we show that $X \to Ω(S^1 \wedge X)\to Ω(S^1 \wedge X \wedge X)$ is a fiber sequence up to homotopy in 2-localized A1-algebraic topology for $X = (S^1)^m \wedge G_m^{\wedge q}$ with $m>1$. It follows that there is an EHP sequence spectral sequence $$Z_{(2)} \otimes π_{n+1+i}^{A1} (S^{2n+2m+1} \wedge (G_m)^{\wedge 2q}) \Rightarrow Z_{(2)} \otimes π_{i}^{A1, s} (S^{m} \wedge (G_m)^{\wedge q}).$$
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a condensed but very basic introduction to the algebraic topology of simplicial manifolds. This text will appear as a chapter in the forthcoming book "Triangulated Manifolds with Few Vertices" by Frank H. Lutz.
Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula
Constructor University（康斯特克特大学）；BIMSA（北京雁栖湖应用数学研究院）；MBZUAI（穆罕默德·本·扎耶德人工智能大学）；MIPT（莫斯科物理技术学院）；IITP RAS（俄罗斯科学院信息传输问题研究所）；Higher School of Economics（高等经济大学）
Let $\mathbf{k}$ be the field $\mathbb{F}_p$ or the ring $\mathbb{Z}$. We study combinatorial and topological properties of the universal simplicial complexes $X(\mathbf{k}^n)$ and $K(\mathbf{k}^n)$ whose simplices are certain unimodular subsets of $\mathbf{k}^n$. As a main result we show that $X(\mathbf{k}^n)$, $K(\mathbf{k}^n)$ and the links of their simplicies are homotopy equivalent to a wedge of spheres specifying the exact number of spheres in the corresponding wedge decompositions. This is a generalisation of Davis and Januszkiewicz's result that $K(\mathbb{Z}^n)$ and $K(\mathbb{F}_2^n)…
Hypergraphs and simplical complexes both capture the higher-order interactions of complex systems, ranging from higher-order collaboration networks to brain networks. One open problem in the field is what should drive the choice of the adopted mathematical framework to describe higher-order networks starting from data of higher-order interactions. Unweighted simplicial complexes typically involve a loss of information of the data, though having the benefit to capture the higher-order topology of the data. In this work we show that weighted simplicial complexes allow to circumvent all the limit…
The polyhedral product is a space constructed from a simplicial complex and a collection of pairs of spaces, which is connected with the Stanley Reisner ring of the simplicial complex via cohomology. Generalizing the previous work Grbic and Theriault, Grujic and Welker, and the authors, we show a decomposition of polyhedral products for a large class of simplicial complexes including the ones whose Alexander duals are shellable or sequentially Cohen-Macaulay. This implies the property, called Golod, of the corresponding Stanley-Reisner rings proved by Herzog, Reiner and Welker.
We study the Linial--Meshulam model of random two-dimensional simplicial complexes. One of our main results states that for $p\ll n^{-1}$ a random 2-complex $Y$ collapses simplicially to a graph and, in particular, the fundamental group $π_1(Y)$ is free and $H_2(Y)=0$, a.a.s. We also prove that, if the probability parameter $p$ satisfies $p\gg n^{-1/2+ε}$, where $ε>0$, then an arbitrary finite two-dimensional simplicial complex admits a topological embedding into a random 2-complex, with probability tending to one as $n\to \infty$. We also establish several related results, for example we show…
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep connection with algebraic topology. We present a novel interpretation of this theorem, through the notion of continuous task, defined by an input/output specification that is a continuous function. To do so, we introduce a chromatic version of a foundational result for algebraic topology: the simplicial approximation theorem. In addition to providing a different proof of the ACT, the notion of continuous task seems interes…
We define a class of probability distributions that we call simplicial mixture models, inspired by simplicial complexes from algebraic topology. The parameters of these distributions represent their topology and we show that it is possible and feasible to fit topological structure to data using a maximum-likelihood approach. We prove under reasonable assumptions that with a fixed number of vertices a distribution can be approximated arbitrarily closely by a simplicial mixture model when using enough simplices. Even if the topology is not of primary interest, when using a model that takes the t…
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in [R.Ehrenborg, G.Hetyei, European J.Combin.27 (2006), no.6, 906-923] on the independence complex and the dominance complex. The techniques used come mainly from monomial ideal theory.
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of simplicial and cubical subdivisions of manifolds and, especially, spheres. We describe important constructions which allow to study all these combinatorial objects by means of methods of commutative and homological algebra. The proposed approach to combinatorial problems relies on the theory of moment-angle complexes, currently being developed by the authors. The …
For a simplicial complex $X$, the $d$-clique complex $Δ_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^α$, with $α< \max\{\frac{-1}{k-d +1},-\frac{d+1}{\binom{k}{d}}\}$ or $α> \frac{-1}{\binom{2k+2}{d}}$, then the $k$-th reduced homology group of the random $d$-clique complex $Δ_d(G_d(n,p))$ is asymptotically almost surely vanishing, and if $\frac{-1}{t} < α< \frac{-1}{t+1}$ where $t = (\frac{(d+1)(k+1)}{\binom{(d+1)(k+1)}{d+1}-(k+1)})^{-1}$, then the $(kd + d -1)$-st reduced homology group of $Δ…
Motivated by the relevance of higher-order interactions in quantum physics and materials science at the nanoscale, recently a model has been introduced for new classes of networks that grow by the geometrically constrained aggregation of simplexes (triangles, tetrahedra and higher-order cliques). Their key features are hyperbolic geometry and hierarchical architecture with simplicial complexes, which can be described by the algebraic topology of graphs. Based on the model of chemically tunable self-assembly of simplexes [Šuvakov et al., Sci.Rep 8, 1987 (2018)], here we study the impact of defe…
We indicate how to combine some classical topology (Thom's work on the Steenrod problem) with some modern topology (simplicial volume) to show that every map between certain manifolds must have degree zero. We furthermore discuss a homotopy theoretic interpretation of parts of our proof, using Thom spaces and Steenrod powers.
Cover Learning for Large-Scale Topology Representation
Centre de Recherches Mathématiques et Institut des sciences mathématiques, Laboratoire de combinatoire et d'informatique mathématique de l'Université du Québec à Montréal, Université de Sherbrooke, Canada（数学研究中心和数学科学研究所，魁北克大学蒙特利尔分校组合与数学信息学实验室， Sherbrooke 大学，加拿大）；Queen Mary University of London, United Kingdom（伦敦女王学院，英国）；Max Planck Institute of Molecular Cell Biology and Genetics（分子细胞生物学与遗传学马克斯·普朗克研究所）；Centre for Systems Biology, Dresden, Germany（系统生物学中心，德累斯顿，德国）；Faculty of Mathematics, Technische Universität Dresden, Germany（数学系，德累斯顿技术大学，德国）；Mathematical Institute, University of Oxford, United Kingdom（数学研究所，牛津大学，英国）
In this paper, we study the graph classification problem in vertex-labeled graphs. Our main goal is to classify the graphs comparing their higher-order structures thanks to heat diffusion on their simplices. We first represent vertex-labeled graphs as simplex-weighted super-graphs. We then define the diffusion Frechet function over their simplices to encode the higher-order network topology and finally reach our goal by combining the function values with machine learning algorithms. Our experiments on real-world bioinformatics networks show that using diffusion Fr{é}chet function on simplices …
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of this concept, called simple-homotopy equivalence: two simplicial complexes are of the same simple-homotopy type if they can be transformed into each other by a sequence of two basic homotopy equivalences, an elementary collapse and its inverse, an elementary expansion. In this article we consider the following related problem: given a 2-dimensional simplicial complex, is there a simple-homotopy equivalence to a 1-dimen…
