Identifying cobordisms using kernel persistence

Abstract

Motivated by applications in chemistry, we give a homlogical definition of tunnels, or more generally cobordisms, connecting disjoint parts of a cell complex. For a filtered complex, this defines a persistence module. We give a method for identifying birth and death times using kernel persistence and a matrix reduction algorithm for pairing birth and death times.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…