The complex of discrete Morse matchings of the n-simplex: homotopy types and structural results

Abstract

The complex of discrete Morse matchings (K), introduced by Chari and Joswig, is a simplicial complex whose simplices are the acyclic matchings on the Hasse diagram of K. Its homotopy type is known in only a handful of cases. In this paper, we compute the homotopy types of (3) and (∂3), the corresponding pure complexes P(3) P(∂3), and the generalized complex of discrete Morse matchings (3) (∂3). For general n we prove the identity f(n) = (n+1) · |top-dimensional facets of (n(n-2))|, reducing the enumeration of optimal matchings on n to an enumeration on its (n-2)-skeleton, and we show that the inclusion (K) (CK) is null-homotopic for any cone. We also compute the f-vector of (4), whose top entry f(4) = 380,125 is the number of optimal discrete Morse matchings on 4. We conclude with two conjectures extending the P and equivalences to all n.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…