Morse-Maxwell Theory for Directed Acyclic Graph
math.AT, math.CO
Submitted: 2026-10-26
Updated: 2026-11-18
Comments: 25 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: The Maxwell graph of a directed acyclic graph records the extrema of its iterated basin and hill boundaries.
Abstract
The Maxwell graph of a directed acyclic graph records the extrema of its iterated basin and hill boundaries. Their unweighted counts need not satisfy Morse inequalities, and the reduction can change homology. We assign multiplicities using the reduced homology of lower and upper order links and retain every vertex with nonzero local homology. This modified reduction preserves both hierarchies, the local groups, and the homology of all sublevel and superlevel order complexes. Its Morse numbers satisfy the weak and strong Morse inequalities over any field. We give explicit formulas in low dimensions and for complete layered graphs. We also construct local Morse numbers for path homology and prove agreement with the reachability construction on complete layered graphs, including those without transitive arrows. Counterexamples distinguish the homology theories and show that local Morse degrees need not equal vertex depths. A comparison with discrete-gradient methods explains the role of auxiliary choices.
Related papers
- An Equivariant Landweber Exact Functor Theorem for Abelian Compact Lie Groups
- The Becker-Gottlieb transfer is not functorial: An example using C infinity-algebras
- Rational homotopy theory of flag manifolds
- K-Theoretic Obstructions to Linearizing QCA Representations
- The sublevel Flood bifiltration: towards scalable 2-parameter persistent homology
- Discrete homotopy groups of cubical sets