Related papers: Path homology of circulant digraphs
Let M be a module over a commutative ring and let Spec(M) (resp. Max(M)) be the collection of all prime (resp. maximal) submodules of M. We topologize Spec(M) with Zariski topology, which is analogous to that for Spec(R), and consider…
In a previous paper [FT1], for any logarithmic symplectic pair (X,D) of a symplectic manifold X and a simple normal crossings symplectic divisor D, we introduced the notion of log pseudo-holomorphic curve and proved a compactness theorem…
Connection graphs (CGs) extend traditional graph models by coupling network topology with orthogonal transformations, enabling the representation of global geometric consistency. They play a key role in applications such as synchronization,…
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
We introduce a new model for investigating spectral properties of quantum graphs, a quantum circulant graph. Circulant graphs are the Cayley graphs of cyclic groups. Quantum circulant graphs with standard vertex conditions maintain…
Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…
K-Theory for hermitian symmetric spaces of non-compact type, as developed recently by the authors, allows to put Cartan's classification into a homological perspective. We apply this method to the case of inductive limits of finite…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
We describe discrete symmetries of two-dimensional Yang-Mills theory with gauge group $G$ associated to outer automorphisms of $G$, and their corresponding defects. We show that the gauge theory partition function with defects can be…
The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…
We present an integral formulation of classical Yang-Mills theory coupled to fermionic and scalar matter fields in (1+1)-dimensional Minkowski spacetime. By reformulating the local dynamics in terms of loop-space holonomies, we demonstrate…
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…
We {\em derive} the exact configuration space path integral, together with the way how to evaluate it, from the Hamiltonian approach for any quantum mechanical system in flat spacetime whose Hamiltonian has at most two momentum operators.…
In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…
A homology cylinder of a surface induces an automorphism of the completed group ring of the fundamental group of the surface. We introduce a new method of computing the automorphism by using the Goldman Lie algebra of the surface or some…
In 2018, by Ramsey and Hoffman theory, Koolen, Yang, and Yang presented a structural result on graphs with smallest eigenvalue at least $-3$ and large minimum degree. In this study, we depart from the conventional use of Ramsey theory and…
In this paper, two sufficient and necessary conditions are given. The first one characterizes when the boundary path groupoid of a topological graph without singular vertices has closed interior of its isotropy group bundle, and the second…
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These…
The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…
We study the topological persistence of the (path) configuration spaces and the (path) independence complexes for digraphs as well as their underlying graphs. We construct some canonical embeddings from the (path) independence complexes of…