Related papers: Effective homology for homotopy colimit and cofibr…
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…
In this paper, an algorithm building the effective homology version of the pushout of the simplicial morphisms $f:X\rightarrow Y$ and $g:X\rightarrow Z$, where $X,Y$ and $Z$ are simplicial sets with effective homology is presented.
To every affine real arrangement of hyperplanes we associate a family of diagrams of spaces over the face poset of the arrangement. We show that any cover of the complement of the complexification of the arrangement is homotopy equivalent…
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…
In this paper we study the problem of determining the homology groups of a quotient of a topological space by an action of a group. The method is to represent the original topological space as a homotopy limit of a diagram, and then act…
For any 1-reduced simplicial set $K$ we define a canonical, coassociative coproduct on $\Om C(K)$, the cobar construction applied to the normalized, integral chains on $K$, such that any canonical quasi-isomorphism of chain algebras from…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
This article proposes an algorithm that constructs a Sullivan minimal model for any simply connected simplicial set with effective homology and thereby allows one to decide algorithmically whether two simply connected spaces represented by…
This paper presents a set of tools to compute topological information of simplicial complexes, tools that are applicable to extract topological information from digital pictures. A simplicial complex is encoded in a (non-unique)…
We establish a general method to produce cofibrant approximations in the model category $U_S(C,D)$ of $S$-valued $C$-indexed diagrams with $D$-weak equivalences and $D$-fibrations. We also present explicit examples of such approximations.…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
In this article, we construct a cofibrantly generated model structure on the category of spaces stratified over a fixed poset, and show that it is Quillen-equivalent to a category of diagrams of simplicial sets. Then, considering all those…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
A stable homology theory is defined for completely distributive CSL algebras in terms of the point-neighbourhood homology of the partially ordered set of meet-irreducible elements of the invariant projection lattice. This specialises to the…
We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well--known methods for computing (co)homology groups, for example, the reduction algorithm consisting in reducing the…
In this paper, a quantum computational framework for algebraic topology based on simplicial set theory is presented. This extends previous work, which was limited to simplicial complexes and aimed mostly to topological data analysis. The…
We show that a set with an action of a locally finite-dimensional free partially commutative monoid and the corresponding semicubical set have isomorpic homology groups. We build a complex of finite length for the computing homology groups…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
Given a closed complex manifold $X$ of even dimension, we develop a systematic (vertex) algebraic approach to study the rational orbifold cohomology rings $\orbsym$ of the symmetric products. We present constructions and establish results…