Related papers: On the homotopy type of multipath complexes
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
In this paper, we investigate the homotopy type and combinatorial properties of total cut complexes of squared cycle graphs. The total cut complexes are a new type of graphical complexes introduced by Bayer et al.(2024) to extend…
We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a…
Assuming complex functions defined on complex curves satisfy recursion relations with respect to number of parameters, we express the corresponding cohomology theory via generalizations of holomorphic connections. In examples provided, the…
Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an input digraph G=(V,A) by a number k of sequences with entries…
This paper proves that the homotopy type of a pointed, simply-connected, 2-reduced simplicial set is determined by the chain-complex augmented by functorial diagonal and higher diagonal maps (a simple generalization of the ones used to…
We show that discrete and classical homotopy theories are equivalent after localizing at n-equivalences for any non-negative integer n. By constructing an explicit homotopy inverse to the graph nerve functor associating an n-fibrant cubical…
The aim of this paper is to present an algorithm which gives all the possible paths that start from a specific node to another of a weighted multi-graph. This algorithm is intended to be applied for the direct topological method.
On every compact and orientable three-manifold, we construct total foliations (three codimension 1 foliations that are transverse at every point). This construction can be performed on any homotopy class of plane fields with vanishing Euler…
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
Path homology plays a central role in digraph topology and GLMY theory more general. Unfortunately, the computation of the path homology of a digraph $G$ is a two-step process, and until now no complete description of even the underlying…
A classification is given of all the countable homogeneous ordered bipartite graphs.
Type families on higher inductive types such as pushouts can capture homotopical properties of differential geometric constructions including connections, curvature, and vector fields. We define a class of pushouts based on simplicial…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
The observed output of an interferometer is the result of interference among the parts of the input light beam traveling along each possible optical path. In complex systems, writing down all these possible optical paths and computing their…
Two important invariants of directed graphs, namely magnitude homology and path homology, have recently been shown to be intimately connected: there is a 'magnitude-path spectral sequence' or 'MPSS' in which magnitude homology appears as…
We study topological spaces with a distinguished set of paths, called directed paths. Since these directed paths are generally not reversible, the directed homotopy classes of directed paths do not assemble into a groupoid, and there is no…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…