Related papers: Simplicial Homology Groups
We provide a recursive construction of an acyclic matching (also known as a gradient vector field, an equivalent notion to a discrete Morse function) on the independence complex of a graph with a simplicial vertex using given acyclic…
The edge group of a simplicial complex is a well-known, combinatorial version of the fundamental group. It is a group associated to a simplicial complex that consists of equivalence classes of edge loops and that is isomorphic to the…
A group-category is an additively semisimple category with a monoidal product structure in which the simple objects are invertible. For example in the category of representations of a group, 1-dimensional representations are the invertible…
Collective Adaptive Systems often consist of many heterogeneous components typically organised in groups. These entities interact with each other by adapting their behaviour to pursue individual or collective goals. In these systems, the…
The notion of a simplicial set originated in algebraic topology, and has also been utilized extensively in category theory, but until relatively recently was not used outside of those fields. However, with the increasing prominence of…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
Using the unbounded picture of analytical K-homology, we associate a well-defined K-homology class to an unbounded symmetric operator satisfying certain mild technical conditions. We also establish an ``addition formula'' for the Dirac…
Persistent homology has been studied to better understand the structural properties and topology features of weighted networks. It can reveal hidden layers of information about the higher-order structures formed by non-pairwise interactions…
We classify the homotopy types of reduced 2-nilpotent simplicial groups in terms of the homology an d boundary invariants $b,\beta$. This contains as special cases results of J.H.C. Whitehead on 1-connected 4-dimensional complexes and of…
The persistent homology with coefficients in a field F coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors…
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 show that the cohomology ring of a finite-dimensional complex pointed Hopf algebra with an abelian group of group-like elements is finitely generated. Our strategy has three major steps. We first reduce the problem to the finite…
A connection between the Galois-theoretic approach to semi-abelian homology and the homological closure operators is established. In particular, a generalised Hopf formula for homology is obtained, allowing the choice of a new kind of…
In many scientific and technological contexts we have only a poor understanding of the structure and details of appropriate mathematical models. We often, therefore, need to compare different models. With available data we can use formal…
This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…
We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…
We present a computational tool that can be used to obtain the "spatial" homology groups of a causal set. Localisation in the causal set is seeded by an inextendible antichain, which is the analog of a spacelike hypersurface, and a one…
This paper provides a self-contained exploration of subdivisions of simplicial complexes, with emphasis on barycentric subdivision. We present formal definitions of subdivisions, show how the realization of a complex is preserved under…