Higher connectivity of the Morse complex

2020/04/22 by Scoville, Nicholas A., Zaremsky, Matthew C. B. · 1 citation
#55U05 #57Q05 #Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.2004.10481

Abstract

The Morse complex M(Δ) of a finite simplicial complex Δ is the complex of all gradient vector fields on Δ. In this paper we study higher connectivity properties of M(Δ). For example, we prove that M(Δ) gets arbitrarily highly connected as the maximum degree of a vertex of Δ goes to ∞, and for Δ a graph additionally as the number of edges goes to ∞. We also classify precisely when M(Δ) is connected or simply connected. Our main tool is Bestvina-Brady Morse theory, applied to a "generalized Morse complex."

Cited by

• Connecting Discrete Morse Functions via Birth-Death Transitions

Related

• Computing gradient vector fields with Morse sequences
• On the automorphism group of the Morse complex
• On discrete gradient vector fields and Laplacians of simplicial\n complexes
• Computing discrete Morse complexes from simplicial complexes
• Filtered matchings and simplicial complexes