A paper by Mischaikow and Nanda [14] uses filtered acyclic matchingsto form a Morse filtration for a filtered complex. The Morse filtration is smallerin size, yet has persistent homology equivalent to that of the original. We give anextension of acyclic matchings to the case of zigzag complexes and prove that theMorse zigzag complex similarly obtained has zigzag homology isomorphic to thatof the original. We present an algorithm to compute a Morse zigzag complex for agiven zigzag complex and some numerical examples. Since the Morse zigzag complexis smaller in size, calculations of its zigzag homology tend to complete faster thanthose for the original zigzag complex. DOI : http://dx.doi.org/10.22342/jims.20.1.177.47-7
In this paper, we prove that the Max Morse Matching Problem is approximable, thus resolving an open ...
Given a simplicial complex and a vector-valued function on its vertices, we present an algorithmic c...
Given a simplicial complex and a vector-valued function on its vertices, we present an algorithmic c...
A paper by Mischaikow and Nanda [14] uses filtered acyclic matchingsto form a Morse filtration for a fi...
International audienceWe introduce a theoretical and computational framework to use discrete Morse t...
International audienceWe introduce a theoretical and computational framework to use discrete Morse t...
We consider the problem of efficiently computing homology with Z coefficients as well as homology ge...
Forman's discrete Morse theory appeared to be useful for providing filtration-preserving reductions ...
International audienceWe introduce a theoretical and computational framework to use discrete Morse t...
Morse theory offers a natural and mathematically-sound tool for shape analysis and understanding. It...
Morse theory offers a natural and mathematically-sound tool for shape analysis and understanding. It...
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig...
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of...
We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify ho...
We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify ho...
In this paper, we prove that the Max Morse Matching Problem is approximable, thus resolving an open ...
Given a simplicial complex and a vector-valued function on its vertices, we present an algorithmic c...
Given a simplicial complex and a vector-valued function on its vertices, we present an algorithmic c...
A paper by Mischaikow and Nanda [14] uses filtered acyclic matchingsto form a Morse filtration for a fi...
International audienceWe introduce a theoretical and computational framework to use discrete Morse t...
International audienceWe introduce a theoretical and computational framework to use discrete Morse t...
We consider the problem of efficiently computing homology with Z coefficients as well as homology ge...
Forman's discrete Morse theory appeared to be useful for providing filtration-preserving reductions ...
International audienceWe introduce a theoretical and computational framework to use discrete Morse t...
Morse theory offers a natural and mathematically-sound tool for shape analysis and understanding. It...
Morse theory offers a natural and mathematically-sound tool for shape analysis and understanding. It...
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig...
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of...
We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify ho...
We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify ho...
In this paper, we prove that the Max Morse Matching Problem is approximable, thus resolving an open ...
Given a simplicial complex and a vector-valued function on its vertices, we present an algorithmic c...
Given a simplicial complex and a vector-valued function on its vertices, we present an algorithmic c...