Related papers: Chain Homotopies for Object Topological Representa…
We propose a method for computing the cohomology ring of three--dimensional (3D) digital binary-valued pictures. We obtain the cohomology ring of a 3D digital binary--valued picture $I$, via a simplicial complex K(I)topologically…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
In this paper, we review a method for computing and parameterizing the set of homotopy classes of chain maps between two chain complexes. This is then applied to finding topologically meaningful maps between simplicial complexes, which in…
This expository article presents a self-contained introduction to simplicial homology for finite simplicial complexes, emphasizing concrete computation and geometric intuition. Beginning with orientations of simplices and the construction…
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…
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…
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…
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 paper, we formalize the notion of lambda-AT-model (where $\lambda$ is a non-null integer) for a given chain complex, which allows the computation of homological information in the integer domain avoiding using the Smith Normal Form…
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…
Cohomology and cohomology ring of three-dimensional (3D) objects are topological invariants that characterize holes and their relations. Cohomology ring has been traditionally computed on simplicial complexes. Nevertheless, cubical…
We prove that the simplicial cocommutative coalgebra of singular chains on a connected topological space determines the homotopy type rationally and one prime at a time, without imposing any restriction on the fundamental group. In…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
While sporadic examples of virtual resolutions with homology have been constructed, their occurrence is not well understood or controlled. Our results build a new set of tools for studying virtual resolutions of monomial ideals as arising…
Let $C_\bullet$ be a simplicial object in the category $Cat$ of small categories. For a field $k$, taking the Grothendieck groups of isomorphism classes of $kC_n$-modules gives rise to a cochain complex, whose cohomology, which we refer to…
This paper proves that the homotopy type of a pointed, simply-connected, 2-reduced simplicial set is determined by the chain-complex augmented by functorial diagonal and higher diagonal maps (a simple generalization of the ones used to…
We compute the cohomology groups of the spaces of colorings of cycles, i.e., of the prodsimplicial complexes Hom(C_m,K_n). We perform the computation first with Z_2, and then with integer coefficients. The main technical tool is to use…
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…
Our work is concerned with simplicial complexes that describe higher-order interactions in real complex systems. This description allows to go beyond the pairwise node-to-node representation that simple networks provide and to capture a…