The Poset of Cancellations in a Filtered Complex
Abstract: Motivated by questions about simplification and topology optimization, we take a discrete approach toward the dependency of topology simplifying operations and the reachability of perfect Morse functions. Representing the function by a filter on a Lefschetz complex, and its (non-essential) topological features by the pairing of its cells via persistence, we simplify using combinatorially defined cancellations. The main new concept is the depth poset on these pairs, whose linear extensions are schedules of cancellations that trim the Lefschetz complex to its essential homology. One such linear extensions is the cancellation of the pairs in the order of their persistence. An algorithm that constructs the depth poset in two passes of standard matrix reduction is given and proven correct.
- P.S. Alexandrov. Diskrete Räume. Mathematiceskii Sbornik (N.S.) 2 (1937), 501–518.
- U. Bauer and F. Roll. Connecting discrete Morse theory and persistence: Wrap complexes and lexicographically optimal cycles. arXiv 2212.02345 [math.AT], 2022.
- D. Cohen-Steiner, H. Edelsbrunner and D. Morozov. Vines and vineyards by updating persistence in linear time. In “Proc. 22nd Ann. Sympos. Comput. Geom., 2006”, 119–126.
- R. Forman. Morse theory for cell complexes. Adv. Math. 134 (1998), 90–145.
- R. Forman. Combinatorial vector fields and dynamical systems. Math. Z. 228 (1998), 629–681.
- M.C. McCord. Singular homology groups and homotopy groups of finite topological spaces. Duke Math. J. 33 (1966), 465–474.
- M. Mrozek. Conley–Morse–Forman theory for combinatorial multivector fields on Lefschetz complexes. Found. Comput. Math. 17 (2017), 1585–1633.
- G. Reeb. Sur les points singuliers d’une forme de Pfaff complètement intégrable ou d’une fonction numérique. C. R. Acad. Sci. Paris 222 (1946), 847–849.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.