Persistence and the Sheaf-Function Correspondence

07/13/2022
by   Nicolas Berkouk, et al.
0

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently introduced the convolution distance between sheaves of k-vector spaces on M. In this paper, we characterize distances on the group of constructible functions on a real finite dimensional vector space that can be controlled by the convolution distance through the sheaf-function correspondence. Our main result asserts that such distances are almost trivial: they vanish as soon as two constructible functions have the same Euler integral. We formulate consequences of our result for Topological Data Analysis: there cannot exists non-trivial additive invariants of persistence modules that are continuous for the interleaving distance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2019

Rank-based persistence

Persistence has proved to be a valuable tool to analyze real world data ...
research
05/24/2018

A derived isometry theorem for constructible sheaves on R

Following Curry and Kashiwara Schapira seminal works on adapting persist...
research
02/02/2022

Topological Classification in a Wasserstein Distance Based Vector Space

Classification of large and dense networks based on topology is very dif...
research
06/17/2022

Projected distances for multi-parameter persistence modules

We introduce the new notions of projected distances and projected barcod...
research
12/14/2021

Homological approximations in persistence theory

We define a class of invariants, which we call homological invariants, f...
research
07/01/2020

Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach

Let f̃(X)∈ℤ[X] be a degree-n polynomial such that f(X):=f̃(X) p factoriz...
research
11/22/2022

Post's correspondence problem for hyperbolic and virtually nilpotent groups

Post's Correspondence Problem (the PCP) is a classical decision problem ...

Please sign up or login with your details

Forgot password? Click here to reset