Related papers: Chain Homotopies for Object Topological Representa…
We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…
This paper is about a small combinatorial trick, which is well known, but has no name. Let G be a permutation group acting on a vector space M. There is a natural way to assign a cosimplicial space to these data. We call the resulting…
Simplicial complexes capture the underlying network topology and geometry of complex systems ranging from the brain to social networks. Here we show that algebraic topology is a fundamental tool to capture the higher-order dynamics of…
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between…
We construct a Baum-Douglas type model for $K$-homology with coefficients in $\mathbb{Z}/k\mathbb{Z}$. The basic geometric object in a cycle is a $spin^c$ $\mathbb{Z}/k\mathbb{Z}$-manifold. The relationship between these cycles and the…
The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some…
This paper examines the dimension of the graded local cohomology $H_\mathfrak{m}^p(S/K^s)_\gamma$ and $H_\mathfrak{m}^p(S/K^{(s)})$ for a monomial ideal $K$. This information is encoded in the reduced homology of a simplicial complex called…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
A crucial step in the analysis of persistent homology is the transformation of data into an appropriate topological object (in our case, a simplicial complex). Modern packages for persistent homology often construct Vietoris--Rips or other…
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this…
We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…
An important example of a model category is the category of unbounded chain complexes of R-modules, which has as its homotopy category the derived category of the ring R. This example shows that traditional homological algebra is…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…
Simplicial complexes form an important class of topological spaces that are frequently used in many application areas such as computer-aided design, computer graphics, and simulation. Representation learning on graphs, which are just 1-d…
We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
Complex molecules and mesoscopic structures are naturally described by general networks of elementary building blocks and tight-binding is one of the simplest quantum model suitable for studying the physical properties arising from the…
A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…
We obtain a mixed complex simpler than the canonical one the computes the type cyclic homologies of a crossed product with invertible cocycle $A\times_{\rho}^f H$, of a weak module algebra $A$ by a weak Hopf algebra $H$ whose unit…