Related papers: Mayer Path Homology
The aim of this paper is to give the geometric realization of regular path complexes via (co)homology groups with coefficients in a ring $R$. Concretely, for each regular path complex $P$, we associate it with a singular $\Delta$-complex…
Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is…
We prove that any digraph Brown functor -- i.e. a contravariant functor from the homotopy category of finite directed graphs to the category of abelian groups, satisfying the triviality axiom, the additivity axiom, and the Mayer-Vietoris…
We prove that the category of directed graphs and graph maps carries a cofibration category structure in which the weak equivalences are the graph maps inducing isomorphisms on path homology.
We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…
We organize and extend a set of computations and structural observations about the Grigoryan--Lin--Muranov--Yau (GLMY) path complex of circulant digraphs $\vec{C}_n^S$ and circulant graphs $C_n^S$. Using the shift automorphism $\tau$ and a…
We investigate the hitherto unexplored relation between the superparticle path integral and superfield theory. Requiring that the path integral has the global symmetries of the classical action and obeys the natural composition property of…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$ contains a directed Hamilton cycle. In this paper we extend this theorem to a random…
We introduce the notion of a move graph, that is, a directed graph whose vertex set is a $\mathbb Z$-module $\mathbb Z_n^m$, and whose arc set is uniquely determined by the action $M\!:\!\mathbb Z_n^m\to \mathbb Z_n^m$ where $M$ is an…
We show how to construct path integrals for quantum mechanical systems where the space of configurations is a general non-compact symmetric space. Associated with this path integral is a perturbation theory which respects the global…
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…
By the work of Harer, the reduced homology of the complex of curves is a fundamental cohomological object associated to all torsion free finite index subgroups of the mapping class group. We call this homology group the Steinberg module of…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
The purpose of this paper is to introduce a version of singular homology based on smooth mappings of manifolds with corners. Although variants of such a theory exists in the literature, we felt that certain points were not adequately…
In this paper, we construct a pointed CW complex called the magnitude homotopy type for a given metric space $X$ and a real parameter $\ell \geq 0$. This space is roughly consisting of all paths of length $\ell$ and has the reduced homology…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
This paper presents several algorithms for hashing directed graphs. The algorithms given are capable of hashing entire graphs as well as assigning hash values to specific nodes in a given graph. The notion of node symmetry is made precise…