English
Related papers

Related papers: 2-Matching Complexes

200 papers

Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…

Algebraic Topology · Mathematics 2016-04-20 Takahiro Matsushita

We address the homotopy theory of 2-crossed modules of commutative algebras, which are equivalent to simplicial commutative algebras with Moore complex of length two. In particular, we construct for maps of 2-crossed modules a homotopy…

Category Theory · Mathematics 2017-05-23 İ. İlker Akça , Kadir Emir , João Faria Martins

We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the…

Combinatorics · Mathematics 2025-06-12 Darij Grinberg , Lukas Katthän , Joel Brewster Lewis

The Dowker theorem is a classical result in the topology of finite spaces, claiming that any binary relation between two finite spaces defines two homotopy-equivalent complexes (the Dowker complexes). Recently, Barmak strengthened this to a…

Combinatorics · Mathematics 2024-07-23 Morten Brun , Darij Grinberg

We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…

Combinatorics · Mathematics 2020-05-15 Tien Chih , Laura Scull

The matching complex $M(G)$ of a graph $G$ is the set of all matchings in $G$. A Buchsbaum simplicial complex is a generalization of both a homology manifold and a Cohen--Macaulay complex. We give a complete characterization of the graphs…

Combinatorics · Mathematics 2023-01-20 Bennet Goeckner , Fran Herr , Legrand Jones , Rowan Rowlands

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

Data Structures and Algorithms · Computer Science 2020-09-11 Fedor V. Fomin , Petr A. Golovach , Lars Jaffke , Geevarghese Philip , Danil Sagunov

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

Combinatorics · Mathematics 2007-05-23 Svante Linusson , John Shareshian , Volkmar Welker

In the context of discrete Morse theory, we introduce Morse frames, which are maps that associate a set of critical simplexes to all simplexes. The main example of Morse frames are the Morse references. In particular, these Morse references…

Discrete Mathematics · Computer Science 2026-03-30 Gilles Bertrand , Laurent Najman

The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(\Delta_n^m)$ that include these matching complexes. Using this…

Combinatorics · Mathematics 2016-06-06 Benjamin Braun , Wesley K. Hough

We construct an equivariant version of discrete Morse theory for simplicial complexes endowed with group actions. The key ingredient is a 2-categorical criterion for making acyclic partial matchings on the quotient space compatible with an…

Group Theory · Mathematics 2022-03-02 Naya Yerolemou , Vidit Nanda

The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…

Combinatorics · Mathematics 2026-04-24 Raju Kumar Gupta , Sourav Sarkar , Sagar S. Sawant , Samir Shukla

Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…

Commutative Algebra · Mathematics 2024-04-11 Ashkan Nikseresht

We describe the homotopy classes of 2 by 2 periodic simple (=non-degenerate) matrices with various symmetries. This turns out to be an elementary exercise in the homotopy of closed curves in three dimensions. The matrices represent gapped…

Mathematical Physics · Physics 2024-02-21 Joseph E. Avron , Ari M. Turner

We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this method to define bisimplices, the cells of a class of regular CW complexes we call bisimplicial complexes. The…

Group Theory · Mathematics 2019-04-16 Nima Hoda

Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…

For a finite simplicial complex K and a CW-pair (X,A), there is an associated CW-complex Z_K(X,A), known as a polyhedral product. We apply discrete Morse theory to a particular CW-structure on the n-sphere moment-angle complexes Z_K(D^{n},…

Combinatorics · Mathematics 2012-12-21 Vladimir Grujic , Volkmar Welker

This paper introduces a categorification of $k$-algebras called 2 -algebras, where k is a commutative ring. We define the 2-algebras as a 2-category with single object in which collections of all 1-morphisms and all 2-morphisms are…

Category Theory · Mathematics 2016-04-21 İbrahim İlker Akça , Ummahan Ege Arslan

A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible…

Geometric Topology · Mathematics 2019-12-04 Jonathan D. Williams

With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.

Combinatorics · Mathematics 2015-06-18 Vladimir Turaev