Related papers: Discrete Morse functions for graph configuration s…
In this thesis we develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
In this work, we introduce a combinatorial-geometric model for the space of discrete Morse functions on any CW complex $X$. We relate this version of a space of discrete Morse functions to the space of cellular filtrations of $X$ and…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
In this paper, we give a necessary and sufficient condition that discrete Morse functions on a digraph can be extended to be Morse functions on its transitive closure, from this we can extend the Morse theory to digraphs by using…
The objective of this note is to provide an interpretation of the discrete version of Morse inequalities, following Witten's approach via supersymmetric quantum mechanics, adapted to finite graphs, as a particular instance of Morse-Witten…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. In this paper, we study the embedded homology as well as the homology of the (lower-)associated simplicial complexes for hypergraphs. We…
Inspired by the works of Forman on discrete Morse theory, which is a combinatorial adaptation to cell complexes of classical Morse theory on manifolds, we introduce a discrete analogue of the stratified Morse theory of Goresky and…
In this paper, we study a class of discrete Morse functions, coming from Discrete Morse Theory, that are equivalent to a class of simplicial stacks, coming from Mathematical Morphology. We show that, as in Discrete Morse Theory, we can see…
The aim of this paper is to analyse algorithms for constructing presentations of graph braid groups from the point of view of anyonic quantum statistics on graphs. In the first part of this paper, we provide a comprehensive review of an…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…
We study transformations between discrete Morse functions on a finite simplicial complex via birth-death transitions--elementary chain maps between discrete Morse complexes that either create or cancel pairs of critical simplices. We prove…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…
We study how powerful algebraic discrete Morse theory is when applied to hull resolutions. The main result describes all cases when the hull resolution of the edge ideal of the complement of a triangle-free graph can be made minimal using…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum geometry on a discrete set means a directed graph with a weight associated to each arrow defining the quantum metric. However, these `lattice spacing' weights do not have to be independent of the direction of the arrow. We use this…
Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…
Topological data analysis can reveal higher-order structure beyond pairwise connections between vertices in complex networks. We present a new method based on discrete Morse theory to study topological properties of unweighted and…