Related papers: Simplicial Homology Groups
We generalize the very well known boundary operator of the ordinary singular homology theory, defined in many books about algebraic topology. We describe a variant of this ordinary simplicial boundary operator where the usual boundary…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
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…
The homology groups of a simplicial complex reveal fundamental properties of the topology of the data or the system and the notion of topological stability naturally poses an important yet not fully investigated question. In the current…
We develop a framework for computing the homology of weighted simplicial complexes with coefficients in a discrete valuation ring. A weighted simplicial complex, $(X,v)$, introduced by Dawson [Cah. Topol. G\'{e}om. Diff\'{e}r. Cat\'{e}g. 31…
We study the homology of simplicial and cubical sets with symmetries. These are simplicial and cubical sets with additional maps expressing the symmetries of simplices and cubes. We consider the chain complex computing the homology groups…
The "simplicial complexes" and "join" (*) today used within combinatorics aren't the classical concepts, cf. Spanier (1966) p. 108-9, but, exept for \emptyset, complexes having {\emptyset} as a subcomplex resp. \Sigma1 * \Sigma2 := {\sigma1…
This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…
The symmetric group on a set acts transitively on its subsets of a given size. We define homomorphisms between the corresponding permutation modules, defined over a field of characteristic two, which generalize the boundary maps from…
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…
Hypergraphs have seen widespread application in network and data science communities in recent years. We present a survey of recent work to construct auxiliary structures from hypergraphs -- specifically simplicial, relative, and chain…
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,…
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…
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)…
This survey describes some useful properties of the local homology of abstract simplicial complexes. Although the existing literature on local homology is somewhat dispersed, it is largely dedicated to the study of manifolds, submanifolds,…
The computation of homology groups for evolving simplicial complexes often requires repeated reconstruction of boundary operators, resulting in prohibitive costs for large-scale or frequently updated data. This work introduces MMHM, a…
For any simplicial complex $X$ with a total ordering of its vertices, one can construct a chain complex $\mathbb{L}_\bullet(X)$ generated by necklaces of simplices in $X$, which computes the homology of the free loop space of the geometric…
Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only…
Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…
We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…