Skip to content
#edge computing Preprint

Complexes of strong discrete Morse matchings

Unknown authors
Sep 2026 · 0 citations · 12 references
Mathematics

Abstract

Using the strong discrete Morse theory developed by Fern\'andez, we define the complex $\mathcal{SM}(K)$ of strong discrete Morse matchings on a simplicial complex $K$, as well as the pure subcomplex $\mathcal{SM}_{pure}(K)$ generated by the facets in $\mathcal{SM}(K)$ of maximal dimension. For most complexes $K$ these objects are proper subcomplexes of the complexes ${\mathfrak M}(K)$ and ${\mathfrak M}_{\textrm{pure}}(K)$ defined by Chari--Joswig using all Morse matchings on $K$. The homotopy types of the latter are not well-understood in general, but they are known when $K$ is the path $P_n$ with $n$ edges, the cycle $C_n$ with $n$ edges, the star $S_n$ with $n$ leaves, the $n$-simplex $\Delta^n$ ($n\le 3$), and the boundary $\partial\Delta^n$ ($n\le 3$). in this paper we compute the homotopy types of $\mathcal{SM}_{pure}(C_n)$ and $\mathcal{SM}(K)$ for $K=P_n,S_n,\Delta^n,\partial\Delta^n$ for all $n$. We also compute the homology of $\mathcal{SM}(C_n)$ for $n\le 21$.

View source

Similar papers

Preprint Sep 2026

Homological invariants of Edge Ideals associated to powers of cycles

Let $G_{n,m}=\overline{\C_n^{[m]}}$, where $\C_n^{[m]}$ denotes the closed $m$th power of the $n$-cycle. We study the graded Betti numbers and homological invariants of the edge ring of $G_{n,m}$ in the range $n\geq 3m+1$. These graphs form a natural family for the study of edge rings whose regularity can be compared e...

Shahnawaz Ahmad Rather, S. Pirzada, M. Aijaz · 1 citation · ⚡1
Preprint Aug 2026

Extremal problems for suspensions of even cycles

Given an integer $k\geq2$ and a graph $F$, the $k$-uniform suspension $\mathcal{S}^kF$ is obtained by adjoining a fixed set of $k-2$ new vertices to every edge of $F$. In this paper, we study two extremal problems for suspensions of even cycles. Write $K^k_t$ for the $k$-uniform clique of order $t$. Let $\mathrm{ex}(n,...

Dingyuan Liu · 0 citations
Preprint Sep 2026

On the number of regular simplices in odd dimensions

Let $S^k_d(n)$ denote the maximum number of regular $(k-1)$-simplices spanned by $n$ points in $\mathbb{R}^d$. For all fixed $r\geq k\geq3$, the exact value of $S^k_{2r}(n)$ was recently determined by Dumitrescu and the authors for all sufficiently large $n$ when $k=3$, and conditionally on an optimization problem when...

Felix Christian Clemen, Dingyuan Liu · 0 citations
Preprint Sep 2026

Reduction of Weil-Deligne Representations

Let $p$ and $\ell$ be distinct odd primes. For a finite extension $F/\mathbb{Q}_p$, the local Langlands correspondence states that there is a canonical bijection between irreducible, smooth representations of $\text{GL}_n(F)$ and $n$-dimensional, $\Phi$-semisimple Weil--Deligne representations of the Weil group $W_F$....

Imin Chen, Deniz Suozer · 0 citations
Preprint Sep 2026

Exchange complexes and contractibility of the complex of incompressible Seifert surfaces

Let $K\subset S^3$ be a non-trivial knot and let $\mathrm{IS}(K)$ be the simplicial complex whose vertices are the ambient isotopy classes of incompressible Seifert surfaces in the exterior $E(K)$, a finite set of distinct vertices spanning a simplex exactly when its classes admit simultaneously pairwise disjoint repre...

Guan-Cheng Pan, Cheng-Song You, Jun-Wei Zhou et al. · 0 citations
Preprint Sep 2026

Profinite completions and cohomology jump loci

Let $X$ be a connected finite-type CW-complex with fundamental group $G$. We show that the profinite completion $\widehat{G}$ determines the cohomology jump loci $\mathcal{V}^q_s(X,\mathbb{C})$ under two hypotheses: that the loci are finite unions of torsion-translated subtori, as for smooth quasi-projective varieties,...

Alexander I. Suciu · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.