On merge trees with a given homological sequence
Nicholas A. Scoville, Dylan Wen

TL;DR
This paper explores the relationship between homological sequences and merge trees derived from discrete Morse functions on trees, demonstrating conditions under which both can be simultaneously induced by a single Morse function.
Contribution
It establishes conditions for constructing a discrete Morse function that induces both a specified merge tree and homological sequence on a tree.
Findings
Existence of a discrete Morse function inducing both structures
Conditions relating merge trees and homological sequences
Insights into topological data analysis tools
Abstract
In this paper, we study the induced homological sequence and the induced merge tree of a discrete Morse function on a tree. A discrete Morse function on a tree gives rise to a sequence of Betti numbers that keep track of the number of components at each critical value. A discrete Morse function on a tree also gives rise to an induced merge tree which keeps track of component birth, death, and merging information. These topological indicators are similar but neither one contains the information of the other. We show that given a merge tree and a homological sequence along with some mild conditions on their relationship, there is a discrete Morse function on a tree that induces both the given merge tree and the given homological sequence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Data Management and Algorithms · Advanced Database Systems and Queries
