Papers
Topics
Authors
Recent
Search
2000 character limit reached

Filtered matchings and simplicial complexes

Published 3 Nov 2020 in math.CO and math.AT | (2011.02015v2)

Abstract: To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories, which we compute in a number of examples. We also completely determine the graded object associated to this filtration in terms of the homology of simpler complexes. This last result provides some connections to the number of vertex-disjoint cycles of a graph.

Summary

Paper to Video (Beta)

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.

Collections

Sign up for free to add this paper to one or more collections.