Related papers: Vietoris-Rips Complexes of Regular Polygons

Recovering homological features of spaces from samples has become one of the central themes of topological data analysis, leading to many successful applications. Many of the results in this area focus on global homological features of a…

We develop a geometric approach to stable homotopy groups of spheres in the spirit of the work of Pontrjagin and Rokhlin. A new proof of the Hopf Invariant One Theorem by J.F.Adams is obtained in all dimensions except 15 and 31. To prove…

The aim of this article is to explain a philosophy for applying higher dimensional Seifert-van Kampen Theorems, and how the use of groupoids and strict higher groupoids resolves some foundational anomalies in algebraic topology at the…

Computation of the simplicial complexes of a large point cloud often relies on extracting a sample, to reduce the associated computational burden. The study considers sampling critical points of a Morse function associated to a point cloud,…

We strengthen the usual stability theorem for Vietoris-Rips (VR) persistent homology of finite metric spaces by building upon constructions due to Usher and Zhang in the context of filtered chain complexes. The information present at the…

We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs.…

Let $G$ be a group acting properly and by isometries on a metric space $X$; it follows that the quotient or orbit space $X/G$ is also a metric space. We study the Vietoris-Rips and \v{C}ech complexes of $X/G$. Whereas (co)homology theories…

We construct a zig-zag from the once delooped space of pseudoisotopies of a closed $2n$-disc to the once looped algebraic $K$-theory space of the integers and show that the maps involved are $p$-locally $(2n-4)$-connected for $n>3$ and…

We describe a method to obtain spherical parameterizations of arbitrary data through the use of persistent cohomology and variational optimization. We begin by computing the second-degree persistent cohomology of the filtered Vietoris-Rips…

Persistent homology is a method from computational algebraic topology that can be used to study the "shape" of data. We illustrate two filtrations --- the weight rank clique filtration and the Vietoris--Rips (VR) filtration --- that are…

We formulate a conjecture that arithmetic locally symmetric manifolds have simple homotopy type, and prove it for the non-compact case. More precisely, we show that, for any symmetric space S of non-compact type without Euclidean de Rham…

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…

Homogeneous compatible almost complex structures on symplectic manifolds are studied, focusing on those which are special, meaning that their Chern-Ricci form is a multiple of the symplectic form. Non Chern-Ricci flat ones are proven to be…

In this paper a geometric approach toward stable homotopy groups of spheres, based on the Pontrjagin-Thom construction is proposed. From this approach a new proof of Hopf Invariant One Theorem by J.F.Adams for all dimensions except…

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…

We define and study several new interleaving distances for persistent cohomology which take into account the algebraic structures of the cohomology of a space, for instance the cup product or the action of the Steenrod algebra. In…

A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…

Hypergraphs are mathematical models for many problems in data sciences. In recent decades, the topological properties of hypergraphs have been studied and various kinds of (co)homologies have been constructed (cf. [3, 4, 12]). In this…

The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…