Papers
Topics
Authors
Recent
Search
2000 character limit reached

Construction of the discrete Morse complex in the non-compact case

Published 11 Dec 2011 in math.AT | (1112.2312v2)

Abstract: We prove an infinite analogue of the main theorem of discrete Morse theory formulated in terms of discrete Morse matchings. Our theorem holds under the assumption that the given Morse matching induces finitely many equivalence classes of infinite directed simple paths. A homological version of the theorem is also given.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.