Elucidating the mechanisms that lead to emergence, evolution, and survival of cooperation in natural systems is still one main scientific challenges current times. During last three decades, theoretical computational models as well experimental data have made it possible unveil explain, from an evolutionary perspective, key processes underlying dynamics cooperation. However, many common coopera...

We try to understand the behavior of algebraic shifting with respect to some basic constructions on simplicial complexes, such as union, coning, and (more generally) join. In particular, for the disjoint union of simplicial complexes we prove ∆(K∪̇L) = ∆(∆(K)∪̇∆(L)) (conjectured by Kalai [2]), and for the join we give an example of simplicial complexes K and L for which ∆(K ∗ L) 6= ∆(∆(K) ∗∆(L)) ...

This work investigates the Delaunay refinement for curved complexes. A manifold complex is defined as an unambiguous representation for the geometric objects required by a partial differential equation solver. The Chew’s and Ruppert’s Delaunay refinement algorithms, including an extension for curved complexes, are described under a new and arbitrary dimensional perspective. A theorem for strong...

This paper introduces two new decomposition techniques which are related to the classical notion of shellability of simplicial complexes, and uses the existence of these decompositions to deduce certain numerical properties for an associated enumerative invariant. First, we introduce the notion of M-shellability, which is a generalization to pure posets of the property of shellability of simpli...

In this work we study the framework of mathematical morphology on simplicial complex spaces. Simplicial complexes are a versatile and widely used structure to represent multidimensional data, such as meshes, that are tridimensional complexes, or graphs, that can be interpreted as bidimensional complexes. Mathematical morphology is one of the most powerful frameworks for image processing, includ...

The Laplace operator on a simplicial complex encodes information about the adjacencies between simplices. A relationship between simplicial complexes does not always translate to a relationship between their Laplacians. In this paper we look at the case of covering complexes. A covering of a simplicial complex is built from many copies of simplices of the original complex, maintaining the adjac...