Abstract Motivated by potential applications in network theory, engineering and computer science, we study r -ample simplicial complexes. These complexes can be viewed as finite approximations to the Rado complex which has a remarkable property of indestructibility, sense that removing any number its simplexes leaves isomorphic itself. We prove an is simply connected 2-connected for large. The ...

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higherdimensional analogue of clique (or flag) complexes (case k = 2) and they are a rich new class of simplicial complexes. We show that Dirac’s theorem on chordal graphs has a higher-dimensional analogue in which graphs and clique ...

Simplicial sets, and more generally simplicial objects in a given category, are central to modern mathematics. While I am not a mathematical historian, I thought I would describe in conceptual outline how naturally simplicial sets arise from the classical study of simplicial complexes. I suspect that something like this recapitulates the historical development. We have described simplicial comp...

We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong collapse and it is a particular kind of simplicial collapse. The advantage of using strong collapses is the existence and uniqueness of cores and their relati...

In this work we study the framework of mathematical morphology on simplicial complex spaces. Simplicial complexes are widely used to represent multidimensional data, such as meshes, that are two dimensional complexes, or graphs, that can be interpreted as one dimensional complexes. Mathematical morphology is one of the most powerful frameworks for image processing, including the processing of d...

We consider here the problem of representing non-manifold shapes discretized as d-dimensional simplicial Euclidean complexes. To this aim, we propose a dimension-independent data structure for simplicial complexes, called the Incidence Simplicial (IS) data structure, which is scalable to manifold complexes, and supports efficient navigation and topological modifications. The IS data structure h...