Combinatorial Morse flows are hard to find
classification
🧮 math.GT
math.COmath.PR
keywords
combinatorialflowsmorsecomplexdetectingfindhardinvestigate
read the original abstract
We investigate the probability of detecting combinatorial Morse flows on a simplicial complex via a random search. We prove that it is really small, in a quantifiable way.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.