Michał Kukieła
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Morse code, Discrete Morse theory, Mathematics, Morse theory, Equivalence (formal languages), Circle-valued Morse theory, Simple (philosophy), Matching (statistics)