English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Preprint

On cycles and merge trees

MPS-Authors
/persons/resource/persons284640

Brüggemann,  Julian       
Max Planck Institute for Mathematics, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

2301.01316v1
(Preprint), 276KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Brüggemann, J., & Scoville, N. A. (submitted). On cycles and merge trees.


Cite as: https://hdl.handle.net/21.11116/0000-000F-BCF5-9
Abstract
In this paper, we extend the notion of a merge tree to that of a generalized merge tree, a merge tree that includes 1-dimensional cycle birth information. Given a discrete Morse function on a 1-dimensional regular CW complex, we construct the induced generalized merge tree. We give several notions of equivalence of discrete Morse functions based on the induced generalized merge tree and how these notions relate to one another. As a consequence, we obtain a complete solution to the inverse problem between discrete Morse functions on 1-dimensional regular CW complexes and generalized merge trees. After characterizing which generalized merge trees can be induced by a discrete Morse function on a simple graph, we give an algorithm based on the induced generalized merge tree of a discrete Morse function f:X→R that cancels the critical simplices of f and replaces it with an optimal discrete Morse function.