Search arXivSearch

arXiv · 2508.15736

Connecting Discrete Morse Functions via Birth-Death Transitions

Abstract

We study transformations between discrete Morse functions on a finite simplicial complex via birth-death transitions--elementary chain maps between discrete Morse complexes that either create or cancel pairs of critical simplices. We prove that any two discrete Morse functions $f_1$, $f_2$ on a finite simplicial complex $K$ are linked by a finite sequence of such transitions.As applications, we present alternative proofs of several of Forman's fundamental results in discrete Morse theory and study the topology of the space of discrete Morse functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chong Zheng. 2025-09-14. Connecting Discrete Morse Functions via Birth-Death Transitions. https://arxiv.org/abs/2508.15736

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO