Morse sequences

Gilles Bertrand
2/12/2024
cs.CV

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

We introduce the notion of a Morse sequence, which provides a simple and effective approach to discrete Morse theory. A Morse sequence is a sequence composed solely of two elementary operations, that is, expansions (the inverse of a collapse), and fillings (the inverse of a perforation). We show that a Morse sequence may be seen as an alternative way to represent the gradient vector field of an arbitrary discrete Morse function. We also show that it is possible, in a straightforward manner, to make a link between Morse sequences and different kinds of Morse functions. At last, we introduce maximal Morse sequences, which formalize two basic schemes for building a Morse sequence from an arbitrary simplicial complex.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bertrand2024morse,
  title  = {Morse sequences},
  author = {Gilles Bertrand},
  year   = {2024},
  eprint = {2402.07526},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.07526v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.07526.svg)](https://codeofpaper.com/paper/2402.07526)

Discussion