Related papers: A Discrete Morse Theory for Digraphs
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
We consider a finite group $G$ acting on a manifold $M$. For any equivariant Morse function, which is a generic condition, there does not always exist an equivariant metric $g$ on $M$ such that the pair $(f,g)$ is Morse-Smale. Here, the…
We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite…
This paper begins the study of Morse theory for orbifolds, or more precisely for differentiable Deligne-Mumford stacks. The main result is an analogue of the Morse inequalities that relates the orbifold Betti numbers of an almost-complex…
Bouc (1992) first studied the topological properties of $M_n$, the matching complex of the complete graph of order $n$, in connection with Brown complexes and Quillen complexes. Bj\"{o}rner et al. (1994) showed that $M_n$ is homotopically…
Vector fields and line fields, their counterparts without orientations on tangent lines, are familiar objects in the theory of dynamical systems. Among the techniques used in their study, the Morse--Smale decomposition of a (generic) field…
In a previous paper we outlined how discrete torsion can be understood geometrically as an analogue of orbifold U(1) Wilson lines. In this paper we shall prove the remaining details. More precisely, in this paper we describe gerbes in terms…
We compute magnitude homology of various graphs using algebraic Morse theory. Specifically, we (1) give an alternative proof that trees are diagonal, (2) identify a new class of diagonal graphs, (3) prove that the icosahedral graph is…
We prove analogues of classical results for higher homotopy groups and singular homology groups of pseudotopological spaces. Pseudotopological spaces are a generalization of (\v{C}ech) closure spaces which are in turn a generalization of…
Our purpose is to explore, in the context of loop ensembles on finite graphs, the relations between combinatorial group theory, loops topology, loop measures, and signatures of discrete paths. We determine the distributions of the loop…
We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
The purpose of this note is to observe that a homomorphism of discrete groups $f:\Gamma\to G$ arises as the induced map $\pi_0(\mathfrak{M})\to \pi_0(\mathfrak{X})$ on path components of some closed normal inclusion of topological groups…
In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…
An explicit isomorphism between Morse homology and singular homology is constructed via the technique of pseudo-cycles. Given a Morse cycle as a formal sum of critical points of a Morse function, the unstable manifolds for the negative…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
We discuss a discretisation of the de Rham-Hodge theory in the two-dimensional case based on a discrete exterior calculus framework. We present discrete analogues of the Hodge-Dirac and Laplace operators in which key geometric aspects of…
Group based moving frames have a wide range of applications, from the classical equivalence problems in differential geometry to more modern applications such as computer vision. Here we describe what we call a discrete group based moving…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…