Related papers: On diagram-chasing in double complexes
Diagram chasing is a customary proof method used in category theory and homological algebra. It involves an element-theoretic approach to show that certain properties hold for a commutative diagram. When dealing with abelian categories for…
The notion of L-homologies (of double complexes) as proposed in this paper extends the notion of classical horizontal and vertical homologies, along with two other new homologies introduced in the homological diagram lemma called salamander…
In the first part of the paper, we establish an homotopical version of the snail lemma (which is a generalization of the classical snake lemma). In the second part, we introduce the category $\mathbf{Seq}(\mathcal A)$ of sequentiable…
Given an abelian category, we characterize the long exact sequences of length six which can be obtained from the snake lemma. Equivalently, these are the long exact sequences which arise as the homology of a triangle in the corresponding…
We survey the basics of homological algebra in exact categories in the sense of Quillen. All diagram lemmas are proved directly from the axioms, notably the five lemma, the 3 x 3-lemma and the snake lemma. We briefly discuss exact functors,…
We consider a notion of exact sequences in any -not necessarily exact- pointed category relative to a given (E;M)-factorization structure. We apply this notion to introduce and investigate a new notion of exact sequences of semimodules over…
This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…
The Kernel Complex Lemma states that given commutative diagram with exact rows and exact columns which covers the region under a $\Gamma$-shape, then the kernel sequence on the top and the kernel sequence at the left have in each position…
We generalize the notion of an exact category and introduce weakly exact categories. A proof of the snake lemma in this general setting is given. Some applications are given to illustrate how one can do homological algebra in a weakly exact…
In this paper, we introduce and investigate a new notion of exact sequences of semimodules over semirings relative to the canonical image factorization. Several homological results are proved using the new notion of exactness including some…
We introduce abelian framed bicategories, which are particular framed bicategories that are locally abelian, and show that they are suitable for developing homology and cohomology theories for directed structures. This means in particular…
We develop a localisation theory for certain categories, yielding a 3-arrow calculus: Every morphism in the localisation is represented by a diagram of length 3, and two such diagrams represent the same morphism if and only if they can be…
We prove an extension to the simplicial Nerve Lemma which establishes isomorphism of persistent homology groups, in the case where the covering spaces are filtered. While persistent homology is now widely used in topological data analysis,…
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…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
In this paper, we construct a seven-term exact sequence involving the cohomology groups of a group extension. Although the existence of such a sequence can be derived using spectral sequence arguments, there is little knowledge about some…
In the paper we describe complexes whose homologies are naturally isomorphic to the first term of the Vassiliev spectral sequence computing (co)homology of the spaces of long knots in R^d, d>=3. The first term of the Vassiliev spectral…
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…