Related papers: Simplicial Homology Groups

We introduce a new invariant defined on the vertices of a given filtered simplicial complex, called codensity, which controls the impact of removing vertices on persistent homology. We achieve this control through the use of an interleaving…

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

This article contains a review of categorifications of semisimple representations of various rings via abelian categories and exact endofunctors on them. A simple definition of an abelian categorification is presented and illustrated with…

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…

The purpose of this note is to point out that simplicial methods and the well-known Dold-Kan construction in simplicial homotopy theory can be fruitfully applied to convert link homology theories into homotopy theories. Dold and Kan prove…

We introduce a model for random chain complexes over a finite field. The randomness in our complex comes from choosing the entries in the matrices that represent the boundary maps uniformly over $\mathbb{F}_q$, conditioned on ensuring that…

We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our…

In [Discrete differential calculus on simplicial complexes and constrained homology, Chin. Ann. Math. Ser. B 44(4), 615-640, 2023], the constrained (co)homology for simplicial complexes and independence hypergraphs is constructed via…

We look at the proofs of a fragment of Linear Logic as a whole: in fact, Linear Logic's coherent semantics interprets the proofs of a given formula $A$ as faces of an abstract simplicial complex, thus allowing us to see the set of the…

We explicitly compute the 2-group of self-equivalences and (homotopy classes of) chain homotopies between them for any {\it split} chain complex $A_{\bullet}$ in an arbitrary $\kb$-linear abelian category ($\kb$ any commutative ring with…

A notion of up and down Grover walks on simplicial complexes are proposed and their properties are investigated. These are abstract Szegedy walks, which is a special kind of unitary operators on a Hilbert space. The operators introduced in…

In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such…

Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…

We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…

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…

In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…

Homological algebra is often understood as the translator between the world of topology and algebra. However, this branch of mathematics is worth studying by itself, given that it provides fascinating perspectives about other disciplines,…

We give explicit formulas for the asymptotic Betti numbers, over an arbitrary field, of the ordered configuration spaces of a graph. In characteristic zero, we further give explicit formulas for the asymptotic multiplicities in homology of…

There is a wealth of applied problems that can be posed as a dynamical system defined on a network with both attractive and repulsive interactions. Some examples include: understanding synchronization properties of nonlinear oscillator;,…

In this tutorial, we provide a didactic treatment of the emerging topic of signal processing on higher-order networks. Drawing analogies from discrete and graph signal processing, we introduce the building blocks for processing data on…