Papers › The discrete flow category: structure and computation
The discrete flow category: structure and computation
Bjørnar Gullikstad Hem
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this article, we use concepts and methods from the theory of simplicial sets to study discrete Morse theory. We focus on the discrete flow category introduced by Vidit Nanda, and investigate its properties in the case where it is defined from a discrete Morse function on a regular CW complex. We design an algorithm to efficiently compute the Hom posets of the discrete flow category in this case. Furthermore, we show that in the special case where the discrete Morse function is defined on a simplicial complex, then each Hom poset has the structure of a face poset of a regular CW complex. Finally, we prove that the spectral sequence associated to the double nerve of the discrete flow category collapses on page 2.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections