Related papers: Rips Complexes of Planar Point Sets

Clustering aims to form groups of similar data points in an unsupervised regime. Yet, clustering complex datasets containing critically intertwined shapes poses significant challenges. The prevailing clustering algorithms widely depend on…

Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…

We show that the $p$-group complex of a finite group $G$ is homotopy equivalent to a wedge of spheres of dimension at most $n$ if $G$ contains a self-centralising normal subgroup $H$ which is isomorphic to a group of Lie type and Lie rank…

For $X$ a metric space and $r>0$ a scale parameter, the Vietoris-Rips complex $VR_<(X;r)$ (resp. $VR_\leq(X;r)$) has $X$ as its vertex set, and a finite subset $\sigma\subseteq X$ as a simplex whenever the diameter of $\sigma$ is less than…

For $n \geq 2$, the $n$-th curvature set of a metric space $X$ is the set consisting of all $n$-by-$n$ distance matrices of $n$ points sampled from $X$. Curvature sets can be regarded as a geometric analogue of configuration spaces. In this…

We express the rational homotopy type of the mapping spaces $\mathrm{Map}^h(\mathsf D_m,\mathsf D_n^{\mathbb Q})$ of the little discs operads in terms of graph complexes. Using known facts about the graph homology this allows us to compute…

The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…

The matching complex of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. In the last few years the matching complexes of grid graphs have gained much attention among the topological combinatorists. In 2017, Braun…

We show that the complex of free factors of a free group of rank n > 1 is homotopy equivalent to a wedge of spheres of dimension n-2. We also prove that for n > 1, the complement of (unreduced) Outer space in the free splitting complex is…

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

A central problem of algebraic topology is to understand the homotopy groups $\pi_d(X)$ of a topological space $X$. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental…

We show that if the fundamental groups of the complements of two line arrangements in the complex projective plane are isomorphic to the same direct sum of free groups, then the complements of the arrangements are homotopy equivalent. For…

\noindent The most natural group topology on $\Z$ is the discrete one. There are other well-known group topologies on $\Z$, like the $p$-adic, defined for any prime number $p$. It is also an important group topology the weak topology with…

We study combinatorial connectivity for two models of random geometric complexes. These two models - \v{C}ech and Vietoris-Rips complexes - are built on a homogeneous Poisson point process of intensity $n$ on a $d$-dimensional torus using…

The space of orientation-compatible almost complex structures on the six-dimensional sphere naturally contains a copy of seven-dimensional real projective space. We show that the inclusion induces an isomorphism on fundamental groups and…

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Many computations in robotics can be dramatically accelerated if the robot configuration space is described as a collection of simple sets. For example, recently developed motion planners rely on a convex decomposition of the free space to…

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…

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…

In Rips Complexes and Covers in the Uniform Category (arXiv:0706.3937) we define, following James, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. In this paper we investigate when these…