Related papers: Mayer Path Homology
We extend Campion's pasting theorem for $(\infty, n)$-categories to a larger class of polygraphs, called the directed complexes with frame-acyclic molecules. It follows, for instance, that this pasting theorem applies to any polygraph…
We propose path integral description for quantum mechanical systems on compact graphs consisting of N segments of the same length. Provided the bulk Hamiltonian is segment-independent, scale-invariant boundary conditions given by…
We introduce a class of linear compartmental models called identifiable path/cycle models which have the property that all of the monomial functions of parameters associated to the directed cycles and paths from input compartments to output…
We develop a framework for computing the homology of weighted simplicial complexes with coefficients in a discrete valuation ring. A weighted simplicial complex, $(X,v)$, introduced by Dawson [Cah. Topol. G\'{e}om. Diff\'{e}r. Cat\'{e}g. 31…
Modular curves $X_{1}(N)$ parametrize elliptic curves with a point of order $N$. They can be identified with connected components of projectivized strata $\mathbb{P}\mathcal{H}(a,-a)$ of meromorphic differentials. As strata of meromorphic…
In \cite{TY}, we investigate the pair $(P, \Supp(P))$ of minimal path $P$ and its supporting sub-digraph $\Supp(P)$ in the path complex of a digraph $G$ under the strongly regular condition. In this paper, first, we consider the special…
We introduce a theory of motivic cohomology for quasi-compact quasi-separated schemes, which generalises the construction of Elmanto--Morrow in the case of schemes over a field. Our construction is non-$\mathbb{A}^1$-invariant in general,…
Many of the tools developed for the theory of tree-decompositions of graphs do not work for directed graphs. In this paper we show that some of the most basic tools do work in the case where the model digraph is a directed path. Using these…
Building upon previous works of Proudfoot and Ramos, and using the categorical framework of Sam and Snowden, we extend the weak categorical minor theorem from undirected graphs to quivers. As case of study, we investigate the consequences…
This is partly a survey and partly a research article. Some known results and open problems about Kaehler groups (fundamental groups of compact Kaehler manifolds) are discussed. A new notion of Kaehler homomorphism is introduced. This is a…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
We propose a novel method for topological analysis of unweighted graphs which is based on \textit{persistent homology}. The proposed method maps the input graph to a complete weighted graph where the weighting function maps each edge to a…
We formulate path integrals on any Riemannian manifold which admits the action of a compact Lie group by isometric transformations. We consider a path integral on a Riemannian manifold M on which a Lie group G acts isometrically. Then we…
We define the notions of Reidemeister torsion and analytic torsion for directed graphs by means of the path homology theory introduced by the authors in \cite{Grigoryan-Lin-Muranov-Yau2013, Grigoryan-Lin-Muranov-Yau2014,…
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…
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…
In the homomorphism order of digraphs, a duality pair is an ordered pair of digraphs $(G,H)$ such that for any digraph, $D$, $G\to D$ if and only if $D\not\to H$. The directed path on $k+1$ vertices together with the transitive tournament…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
Let D be an arbitrary subset of the natural numbers. For every n, let M(n;D) be the maximum of the cardinality of a set of Hamiltonian paths in the complete graph K_n such that the union of any two paths from the family contains a not…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…