Related papers: On the Classification of Planar-Rips complexes and…
The computational cost of persistent homology is often dominated by the growth of the underlying simplicial filtrations. Many different filtrations exist, each with its own assumptions and trade-offs, but all face some form of this growth…
A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…
For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…
We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log…
For a genus g handlebody H a simplicial complex, with vertices being isotopy classes of certain incompressible surfaces in H, is constructed and several properties are established. In particular, this complex naturally contains, as a…
We introduce the monoidal Rips filtration, a filtered simplicial set for weighted directed graphs and other lattice-valued networks. Our construction generalizes the Vietoris-Rips filtration for metric spaces by replacing the maximum…
Let $\mathcal{H}$ be a hypergraph of rank $r$. We show that the simplicial complex whose simplices are the hypergraphs $\mathcal{F}\subset\mathcal{H}$ with covering number at most $p$ is $\left(\binom{r+p}{r}-1\right)$-collapsible, and the…
There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…
In this paper we consider the hyperspace $C_{n}(X)$ of non-empty and closed subsets of a base space $X$ with up to $n$ connected components. We consider a class of base spaces called finite ray-graphs, which are a noncompact variation on…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…
In this work, we construct a new data type for hadronic jets in which the traditional point-cloud representation is transformed into a simplicial complex consisting of vertices, or 0-simplexes. An angular resolution scale, $r$, is then…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
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…
For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
Recall that the radius of a compact metric space $(X, dist)$ is given by $rad\ X = \min_{x\in X} \max_{y\in X} dist(x,y)$. In this paper we generalize Berger's $\frac{1}{4}$-pinched rigidity theorem and show that a closed, simply connected,…
We call every complex connected (1,1)-dimensional supermanifold a super Riemann surface and construct versal super families of compact ones, where the base spaces are allowed to be certain ringed spaces including all complex supermanifolds.…
The image of the branch set of a PL branched cover between PL $n$-manifolds is a simplicial $(n-2)$-complex. We demonstrate that the reverse implication also holds: an open and discrete map $f \colon \mathbb{S}^n \to \mathbb{S}^n$ with the…