Related papers: Curvature Sets Over Persistence Diagrams

With a view towards providing tools for analyzing and understanding digitized images, various notions from algebraic topology have been introduced into the setting of digital topology. In the ordinary topological setting, invariants such as…

We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…

Given a sample $Y$ from an unknown manifold $X$ embedded in Euclidean space, it is possible to recover the homology groups of $X$ by building a Vietoris--Rips or \v{C}ech simplicial complex on top of the vertex set $Y$. However, these…

For a metric space $(X, d)$ and a scale parameter $r \geq 0$, the Vietoris-Rips complex $\mathcal{VR}(X;r)$ is a simplicial complex on vertex set $X$, where a finite set $\sigma \subseteq X$ is a simplex if and only if diameter of $\sigma$…

Characterizing the homotopy types of the Vietoris--Rips complexes of a metric space $X$ is in general a difficult problem. The Vietoris--Rips metric thickening, a metric space analogue of the Vietoris--Rips complex, was introduced as a…

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…

Classical persistent homology is a powerful mathematical tool for shape comparison. Unfortunately, it is not tailored to study the action of transformation groups that are different from the group Homeo(X) of all self-homeomorphisms of a…

A method is presented for the distributed computation of persistent homology, based on an extension of the generalized Mayer-Vietoris principle to filtered spaces. Cellular cosheaves and spectral sequences are used to compute global…

We investigate the local geometry of a pair of independent contact structures on 3-manifolds under maps that independently preserve each contact structure. We discover that such maps are homotheties on the contact 1-forms and we discover…

We introduce a metric homotopy theory, which we call Moderately Discontinuous Homotopy, designed to capture Lipschitz properties of metric singular subanalytic germs. It matches with the Moderately Discontinuous Homology theory receantly…

The family of $\mathfrak{I}$-contractible graphs and contractible transformations was defined by A. Ivashchenko in the mid-90's. In this paper we study the collapsibility and homological properties of the clique complex associated to…

Stability and dependence are model-theoretic notions that have recently proved highly effective in the study of structural and algorithmic properties of hereditary graph classes, and are considered key notions for generalizing to hereditary…

We carry out a detailed quantitative analysis on the geometry of invariant manifolds for smooth dissipative systems in dimension two. We begin by quantifying the regularity of any orbit (finite or infinite) in the phase space with a set of…

We prove a Kunneth theorem for the Vietoris-Rips homology and cohomology of a semi-uniform space. We then interpret this result for graphs, where we show that the Kunneth theorem holds for graphs with respect to the strong graph product. We…

Cohomological ideas have recently been injected into persistent homology and have for example been used for accelerating the calculation of persistence diagrams by the software Ripser. The cup product operation which is available at…

We investigate the structure of subspaces of a Hilbert space that are invariant under unitary representations of a discrete group. We work with square integrable representations, and we show that they are those for which we can construct an…

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…

We introduce graph motif parameters, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs. Classical works by Lov\'asz show that many interesting quantities have this form, including, for fixed…

Segmenting curvilinear structures in medical images is essential for analyzing morphological patterns in clinical applications. Integrating topological properties, such as connectivity, improves segmentation accuracy and consistency.…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…