Related papers: On diagram-chasing in double complexes
To do homological algebra with unbounded chain complexes one needs to first find a way of constructing resolutions. Spaltenstein solved this problem for chain complexes of R-modules by truncating further and further to the left, resolving…
We provide first a categorical exploration of, and then completion of the mapping of the relationships among, three fundamental perspectives on binary relations: as the incidence matrices of hypergraphs, as the formal contexts of concept…
Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similarity ranking, require to decide if objects in one rectangle A…
With the recent advances in the object detection research field, tracking-by-detection has become the leading paradigm adopted by multi-object tracking algorithms. By extracting different features from detected objects, those algorithms can…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
We provide a foundation for working with homological and homotopical methods in categorical algebra. This involves two mutually complementary components, namely (a) the strategic selection of suitable axiomatic frameworks, some well known…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
The notion of a duality between two derived functors as well as an extension theorem for derived functors to larger categories in which they need not be defined is introduced. These ideas are then applied to extend and study the coext…
Correlation clustering is a widely studied framework for clustering based on pairwise similarity and dissimilarity scores, but its best approximation algorithms rely on impractical linear programming relaxations. We present faster…
Persistent Homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape, and structure of the neighborhood of individual data…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…
We show that for a given exact category, there exists a bijection between semibricks (pairwise Hom-orthogonal set of bricks) and length wide subcategories (exact extension-closed length abelian subcategories). In particular, we show that a…
We consider the bar complex of a monomial non-unital associative algebra $A=k \langle X \rangle / (w_1,...,w_t)$. It splits as a direct sum of complexes $B_w$, defined for any fixed monomial $w=x_1...x_n \in A$. We give a simple argument,…
In a k-linear triangulated category (where k is a field) we show that the existence of Auslander-Reiten triangles implies that objects are determined, up to shift, by knowing dimensions of homomorphisms between them. In most cases the…
We extend the notions of complete intersection dimension and lower complete intersection dimension to the category of complexes with finite homology and verify basic properties analogous to those holding for modules. We also discuss the…
We address the problem of inferring self-supervised dense semantic correspondences between objects in multi-object scenes. The method introduces learning of class-aware dense object descriptors by providing either unsupervised discrete…
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
Translation association schemes are constructed from actions of finite groups on finite abelian groups satisfying certain natural conditions. It is also shown that the mere existence of maps from finite groups to themselves sending each…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…