Related papers: The double of a simplicial complex
We prove Conjecture F from [VW12] which states that the complements of closures of certain strata of the symmetric power of a smooth irreducible complex variety exhibit rational homological stability. Moreover, we generalize this conjecture…
Refining a basic result of Alexander, we show that two flag simplicial complexes are piecewise linearly homeomorphic if and only if they can be connected by a sequence of flag complexes, each obtained from the previous one by either an edge…
For deep learning problems on graph-structured data, pooling layers are important for down sampling, reducing computational cost, and to minimize overfitting. We define a pooling layer, nervePool, for data structured as simplicial…
Simplicial homology is a classical tool that assigns a sequence of modules to a simplicial complex, providing invariants for the study of its topological properties. In this article, we introduce the notion of L-fuzzy simplicial homology, a…
Conjecture F from [VW12] states that the complements of closures of certain strata of the symmetric power of a smooth irreducible complex variety exhibit rational homological stability. We prove a generalization of this conjecture to the…
We prove that every finite connected simplicial complex has the homology of the classifying space for some $\mathrm{CAT}(0)$ cubical duality group. More specifically, for any finite simplicial complex $X$, we construct a locally…
We consider a nonlinear flow on simplicial complexes related to the simplicial Laplacian, and show that it is a generalization of various consensus and synchronization models commonly studied on networks. In particular, our model allows us…
In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one…
We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and…
Given a simplicial complex and a collection of subcomplexes covering it, the nerve theorem, a fundamental tool in topological combinatorics, guarantees a certain connectivity of the simplicial complex when connectivity conditions on the…
In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For…
Algorithms for persistent homology and zigzag persistent homology are well-studied for persistence modules where homomorphisms are induced by inclusion maps. In this paper, we propose a practical algorithm for computing persistence under…
We develop basic homological machinery for Z-algebras in order to prove a version of local duality for Ext-finite connected Z-algebras. As an application, we compare two notions of regularity for such algebras.
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
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…
We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…
In their solution to the orchard-planting problem, Green and Tao established a structure theorem which proves that in a line arrangement in the real projective plane with few double points, most lines are tangent to the dual curve of a…
On taking a non-trivial and semi-transitive bi-relation constituted by two (hard and soft) binary relations, we report a (i) p-continuity assumption that guarantees the completeness and transitivity of its soft part, and a (ii)…