Related papers: Dowker Complexes and filtrations on self-relations
We construct a simplicial complex, the rectangle complex of a relation R, and show that it is homotopy equivalent to the Dowker complex of R. This results in a short and conceptual proof of functorial versions of Dowker's Theorem used in…
Given a relation $R \subseteq I \times J$ between two sets, Dowker's Theorem (1952) states that the homology groups of two associated simplicial complexes, now known as Dowker complexes, are isomorphic. In its modern form, the full result…
We explain how homotopical information of two composeable relations can be organized in two simplicial categories that augment the relations row and column complexes. We show that both of these categories realize to weakly equivalent…
We propose a categorification of the Dowker duality theorem for relations. Dowker's theorem states that the Dowker complex of a relation $R \subseteq X \times Y$ of sets $X$ and $Y$ is homotopy equivalent to the Dowker complex of the…
The Dowker complex is an abstract simplicial complex that is constructed from a binary relation in a straightforward way. Although there are two ways to perform this construction -- vertices for the complex are either the rows or the…
This paper presents three short, new proofs of Dowker duality using various poset fiber lemmas. We introduce modifications of joins and products of simplicial complexes called relational join and relational product complexes. These…
The Dowker complex $\mathrm{D}_{R}(X,Y)$ is a simplicial complex capturing the topological interplay between two finite sets $X$ and $Y$ under some relation $R\subseteq X\times Y$. While its definition is asymmetric, the famous Dowker…
The Dowker theorem is a classical result in the topology of finite spaces, claiming that any binary relation between two finite spaces defines two homotopy-equivalent complexes (the Dowker complexes). Recently, Barmak strengthened this to a…
There is a canonical way to associate two simplicial complexes K, L to any relation $R\subset X\times Y$. Moreover, the geometric realizations of K and L are homotopy equivalent. This was studied in the fifties by C.H. Dowker. In this…
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,…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
We define two model structures on the category of bicomplexes concentrated in the right half plane. The first model structure has weak equivalences detected by the totalisation functor. The second model structure's weak equivalences are…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
We define an order relation among oriented $PD_4$-complexes. We show that with respect to this relation, two $PD_4$-complexes over the same complex are homotopy equivalent if and only if there is an isometry between the second homology…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…
We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…
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…