arxiv: 2604.18172 · v1 · submitted 2026-04-20 · 🧮 math.AT · math.CO

Recognition: unknown

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

Nicholas A. Scoville

Pith reviewed 2026-05-10 03:34 UTC · model grok-4.3

classification 🧮 math.AT math.CO

keywords discrete Morse matchingssimplicial complexhomotopy typen-simplexacyclic matchingHasse diagramf-vectornull-homotopic

0 comments

The pith

The complex of discrete Morse matchings on the 3-simplex has a homotopy type equivalent to that on its boundary, with a recursive formula counting its top facets for any n.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper establishes explicit homotopy types for the complex of discrete Morse matchings on the 3-simplex and its boundary. It proves that the pure version and the generalized version of these complexes are homotopy equivalent. For any dimension n, it shows that the number of top-dimensional simplices in the matching complex on the n-simplex equals n plus one times the number of such simplices on the (n-2)-skeleton. This identity reduces the problem of counting optimal discrete Morse matchings on high-dimensional simplices to lower-dimensional cases. The paper also proves that the inclusion of the matching complex of any complex into the matching complex of its cone is null-homotopic and gives the complete f-vector for the 4-simplex.

Core claim

We compute the homotopy types of M(Δ³) and M(∂Δ³), show M_P(Δ³) ≃ M_P(∂Δ³) and GM(Δ³) ≃ GM(∂Δ³), prove the identity f(n)=(n+1)·|top-dimensional facets of M(Δ^n_{(n-2)})|, establish that the inclusion M(K) hookrightarrow M(CK) is null-homotopic for any K, and compute the f-vector of M(Δ⁴) with top entry 380125. We conclude with conjectures on the equivalences for all n.

What carries the argument

The simplicial complex M(K) whose simplices are the acyclic matchings on the Hasse diagram of the simplicial complex K.

Load-bearing premise

The explicit computations rest on an exhaustive and accurate enumeration of all acyclic matchings on the Hasse diagrams involved.

What would settle it

Finding a different total than 380125 for the number of optimal matchings on the 4-simplex through a separate enumeration would disprove the reduction formula.

Figures

Figures reproduced from arXiv: 2604.18172 by Nicholas A. Scoville.

**Figure 1.** Figure 1: The top-facet bijection ϕ of Proposition 9 for n = 2. Left: An optimal matching on ∆2 with matched pairs (v1, v1v3), (v2, v2v3), and (v1v2, v1v2v3); the unique critical simplex is v3. Right: The image ϕ(F) on ∂∆2 , obtained by deleting the pair (v1v2, v1v2v3) involving the 2-simplex. The surviving pairs (v1, v1v3) and (v2, v2v3) form an optimal matching on ∂∆2 with two critical simplices: v3 and v1v2 [PI… view at source ↗

**Figure 2.** Figure 2: Illustration of Lemma 12 for n = 3. Left: An optimal matching on ∆3 (1) with matched pairs (v1, e01), (v2, e02), (v3, e03) and critical vertex v0. Right: The complete graph K4 on the vertex set {F0, F1, F2, F3}, where each edge is labeled by the (n−2) face of ∆3 it represents. The thickened edges are those corresponding to the critical edges of the matching, forming a spanning tree centered at F0. To see t… view at source ↗

read the original abstract

The complex of discrete Morse matchings $\M(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 $\M(\Delta^3)$ and $\M(\partial\Delta^3)$, the corresponding pure complexes $\M_{P}(\Delta^3) \simeq \M_{P}(\partial\Delta^3)$, and the generalized complex of discrete Morse matchings $\GM(\Delta^3) \simeq \GM(\partial\Delta^3)$. For general $n$ we prove the identity $f(n) = (n+1) \cdot |\text{top-dimensional facets of } \M(\Delta^n_{(n-2)})|$, reducing the enumeration of optimal matchings on $\Delta^n$ to an enumeration on its $(n-2)$-skeleton, and we show that the inclusion $\M(K) \hookrightarrow \M(CK)$ is null-homotopic for any cone. We also compute the $f$-vector of $\M(\Delta^4)$, whose top entry $f(4) = 380{,}125$ is the number of optimal discrete Morse matchings on $\Delta^4$. We conclude with two conjectures extending the $\M_{P}$ and $\GM$ equivalences to all $n$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper computes homotopy types for the 3-simplex matching complex and a reduction identity, with the enumerations as the part to verify.

read the letter

The main things to know are that this paper computes the homotopy types of M(Δ³) and M(∂Δ³) along with their pure and generalized versions, and proves a reduction that expresses the number of optimal matchings on the n-simplex in terms of the (n-2)-skeleton. These homotopy types and the f-vector for n=4 with top entry 380125 are new results. The identity f(n) = (n+1) · |top-dimensional facets of M(Δ^n_{(n-2)})| is a proved structural fact, and the null-homotopy for cone inclusions is another general observation. The two conjectures extend the equivalences seen for n=3. The paper does well in delivering these explicit calculations in a corner of combinatorial topology where few homotopy types were previously known. The reduction could make higher-dimensional cases more tractable, and the general null-homotopy result is clean. The soft spots are around the enumeration. The specific homotopy types and the count of 380125 come from listing all acyclic matchings, so any slip in cycle detection or duplicate avoidance would affect the outcomes. The paper likely includes the details of how this was done, but that part bears the weight of the concrete claims. This work is aimed at researchers in discrete Morse theory and simplicial complexes. A reader focused on homotopy computations or looking for ways to reduce enumeration problems will find it relevant. It has enough original content and a solid identity to merit a serious referee. I would recommend sending it out for peer review.

Referee Report

2 major / 2 minor

Summary. The paper studies the simplicial complex M(K) whose simplices are the acyclic matchings on the Hasse diagram of a simplicial complex K, with focus on K = Δ^n and its boundary. It computes the homotopy types of M(Δ³), M(∂Δ³), the pure subcomplexes M_P(Δ³) ≃ M_P(∂Δ³), and the generalized complexes GM(Δ³) ≃ GM(∂Δ³). For general n it proves the identity f(n) = (n+1) · |top-dimensional facets of M(Δ^n_{(n-2)})|, computes the full f-vector of M(Δ^4) (with top entry 380125), proves that the inclusion M(K) ↪ M(CK) is null-homotopic for any cone CK, and states two conjectures extending the equivalences to higher n.

Significance. If the enumerations are accurate, the explicit homotopy types for n=3 and the reduction formula constitute a concrete advance, as homotopy types of M(K) were previously known in only a handful of cases. The null-homotopy of the cone inclusion supplies a structural tool that may simplify future arguments, while the f-vector entry for n=4 supplies a benchmark number. The conjectures are natural extensions of the n=3 data.

major comments (2)

[computational results for n=3 and n=4] The homotopy-type computations for M(Δ³), M(∂Δ³), M_P and GM, together with the top f-vector entry f(4)=380125, rest on exhaustive enumeration of acyclic matchings. The manuscript should supply, in the section describing these computations, a precise account of the Hasse-diagram construction, the cycle-detection procedure, and the method used to avoid duplicate matchings, so that the enumeration can be independently verified; an undetected cycle or overcount would directly falsify the reported homotopy types and the numerical identity for n=4.
[general-n identity] The proof of the reduction identity f(n)=(n+1)·|top-dimensional facets of M(Δ^n_{(n-2)})| reduces the n-case to the (n-2)-skeleton but still depends on the correctness of the base enumerations for small n. The argument should explicitly check the boundary cases n=3 and n=4 against the independently computed values to confirm that the identity holds without circularity.

minor comments (2)

The definitions of the pure complex M_P and the generalized complex GM should be recalled or cross-referenced at the first appearance of the homotopy-type statements for n=3.
[conjectures] The two conjectures at the end would benefit from a short paragraph indicating which features of the n=3 data motivate them.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the constructive comments, which will help improve the clarity and verifiability of our results. We address each major comment below and will revise the manuscript accordingly.

read point-by-point responses

Referee: The homotopy-type computations for M(Δ³), M(∂Δ³), M_P and GM, together with the top f-vector entry f(4)=380125, rest on exhaustive enumeration of acyclic matchings. The manuscript should supply, in the section describing these computations, a precise account of the Hasse-diagram construction, the cycle-detection procedure, and the method used to avoid duplicate matchings, so that the enumeration can be independently verified; an undetected cycle or overcount would directly falsify the reported homotopy types and the numerical identity for n=4.

Authors: We agree that a precise description of the computational procedures is necessary to allow independent verification. In the revised manuscript we will add a dedicated subsection (or appendix) detailing: the explicit construction of the Hasse diagrams for Δ^n and ∂Δ^n; the cycle-detection algorithm (a depth-first search on the directed graph induced by each candidate matching to detect directed cycles); and the duplicate-avoidance method (recursive generation of matchings ordered by the lexicographically smallest sequence of matched edges, ensuring each matching is produced exactly once). These additions will make the enumerations for n=3 and n=4 fully reproducible. revision: yes
Referee: The proof of the reduction identity f(n)=(n+1)·|top-dimensional facets of M(Δ^n_{(n-2)})| reduces the n-case to the (n-2)-skeleton but still depends on the correctness of the base enumerations for small n. The argument should explicitly check the boundary cases n=3 and n=4 against the independently computed values to confirm that the identity holds without circularity.

Authors: The combinatorial proof of the identity is self-contained and does not rely on the specific numerical enumerations for small n; it therefore contains no circularity. To address the referee’s request for explicit confirmation, we will add a short verification paragraph in the section on the reduction formula. We will substitute the independently computed values: for n=3, verify that f(3) equals 4 times the number of top-dimensional facets of M(Δ³_{(1)}); for n=4, verify that f(4)=380125 equals 5 times the number of top-dimensional facets of M(Δ⁴_{(2)}). These checks will be presented alongside the general proof. revision: yes

Circularity Check

0 steps flagged

No circularity; derivations are independent enumerations and reductions.

full rationale

The complex M(K) is defined externally via Chari-Joswig as the simplicial complex of acyclic matchings on the Hasse diagram of K. Homotopy types for Δ³ and ∂Δ³ are obtained by direct enumeration of those matchings, not by any self-referential equation. The identity f(n)=(n+1)·|top facets of M(Δⁿ_{(n-2)})| is a proven reduction that lowers dimension without presupposing the target count; the n=4 value 380125 follows from applying the reduction to an explicit base enumeration. The null-homotopy of M(K)↪M(CK) is established by a direct argument on cones. No self-citations are load-bearing, no parameters are fitted then renamed as predictions, and no ansatz or uniqueness claim is smuggled in. The work is self-contained against external combinatorial definitions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on the standard definition of the complex of discrete Morse matchings introduced by Chari and Joswig; no new free parameters, invented entities, or ad-hoc axioms are introduced in the abstract. All background results invoked are from established combinatorial topology.

axioms (2)

domain assumption M(K) is the simplicial complex whose simplices are the acyclic matchings on the Hasse diagram of K.
This is the foundational definition taken from prior work by Chari and Joswig.
domain assumption Homotopy type can be determined by exhaustive enumeration of matchings for small-dimensional simplices such as Δ³.
Implicit in the claim that the homotopy types are computed for n=3.

pith-pipeline@v0.9.0 · 5566 in / 1678 out tokens · 34507 ms · 2026-05-10T03:34:45.060423+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

20 extracted references

[1]

J. A. Barmak,Algebraic topology of finite topological spaces and applications, Lecture Notes in Mathematics, vol. 2032, Springer, Heidelberg, 2011

2032
[2]

Bauer,Ripser: efficient computation of Vietoris-Rips persistence barcodes, J

U. Bauer,Ripser: efficient computation of Vietoris-Rips persistence barcodes, J. Appl. Com- put. Topol.5(2021), no. 3, 391–423. MR 4298669

2021
[3]

A. C. Bravo and O. A. Camarena,Homotopy type through homology groups, Bol. Soc. Mat. Mex. (3)30(2024), no. 2, Paper No. 28, 6. MR 4715353

2024
[4]

Brüggemann,The space of discrete morse functions, 2026

J. Brüggemann,The space of discrete morse functions, 2026

2026
[5]

N. A. Capitelli and E. G. Minian,A simplicial complex is uniquely determined by its set of discrete Morse functions, Discrete Comput. Geom.58(2017), no. 1, 144–157

2017
[6]

Hautes Études Sci

J.Cerf,La stratification naturelle des espaces de fonctions différentiables réelles et le théorème de la pseudo-isotopie, Inst. Hautes Études Sci. Publ. Math.39(1970), 7–170

1970
[7]

M. K. Chari and M. Joswig,Complexes of discrete Morse functions, Discrete Math.302 (2005), no. 1-3, 39–51

2005
[8]

Donovan, M

C. Donovan, M. Lin, and N. A. Scoville,On the homotopy and strong homotopy type of complexes of discrete morse functions, Canadian Mathematical Bulletin (2022), 1–19

2022
[9]

Donovan and N

C. Donovan and N. A. Scoville,Star clusters in the matching, Morse, and generalized complex of discrete Morse functions, New York J. Math.29(2023), 1393–1412. MR 4689113

2023
[10]

R. E.Zax,Simplifying complicated simplicial complexes: Discrete morse theory and its appli- cations, Senior thesis, Harvard University, Cambridge, Massachusetts, March 2012, Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of A.B. in Mathematics

2012
[11]

Forman,Morse theory for cell complexes, Adv

R. Forman,Morse theory for cell complexes, Adv. Math.134(1998), no. 1, 90–145

1998
[12]

,A user’s guide to discrete Morse theory, Sém. Lothar. Combin.48(2002), Art. B48c, 35

2002
[13]

Knudson,Morse theory: Smooth and discrete, World Scientific Publishing Co

K. Knudson,Morse theory: Smooth and discrete, World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2015

2015
[14]

D. N. Kozlov,Complexes of directed trees, J. Combin. Theory Ser. A88(1999), no. 1, 112–122

1999
[15]

207, American Mathematical Society, Providence, RI, [2020]©2020

,Organized collapse: an introduction to discrete Morse theory, Graduate Studies in Mathematics, vol. 207, American Mathematical Society, Providence, RI, [2020]©2020. MR 4249617

2020
[16]

Lin and N

M. Lin and N. A. Scoville,On the automorphism group of the Morse complex, Adv. in Appl. Math.131(2021), Paper No. 102250, 17. MR 4290144

2021
[17]

Robins, P

V. Robins, P. J. Wood, and A. P. Sheppard,Theory and algorithms for constructing discrete Morse complexes from grayscale digital images, IEEE Trans. Pattern Anal. Mach. Intell.33 (2011), no. 8, 1646–1658

2011
[18]

N. A. Scoville,Discrete Morse theory, Student Mathematical Library, vol. 90, American Math- ematical Society, Providence, RI, 2019. MR 3970274

2019
[19]

N. A. Scoville and M. C. B. Zaremsky,Higher connectivity of the Morse complex, Proc. Amer. Math. Soc. Ser. B9(2022), 135–149. MR 4407041 22 N.A. SCOVILLE

2022
[20]

E. H. Spanier,Algebraic topology, McGraw-Hill Book Co., New York-Toronto-London, 1966. MR 210112 Department of Mathematics and Computer Science, Ursinus College, Collegeville PA 19426 Email address:nscoville@ursinus.edu

1966