Related papers: Homology of weighted path complexes and directed h…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
Like (co)homology group theory of formal Hamiltonian vector fields on symplectic vector spaces, we try studying homology group theory on symplecit tori introducing the notion of weight.
Let V be a cofibrantly generated closed symmetric monoidal model category and M a model V-category. We say that a weighted colimit W*D of a diagram D weighted by W is a homotopy weighted colimit if the diagram D is pointwise cofibrant and…
Simplicial type theory extends homotopy type theory with a directed path type which internalizes the notion of a homomorphism within a type. This concept has significant applications both within mathematics -- where it allows for synthetic…
Let $P$ be a finite poset. We will show that for any reasonable $P$-persistent object $X$ in the category of finite topological spaces, there is a $P-$ weighted graph, whose clique complex has the same $P$-persistent homology as $X$.
Implementing an idea due to John Baez and James Dolan we define new invariants of Whitney stratified manifolds by considering the homotopy theory of smooth transversal maps. To each Whitney stratified manifold we assign transversal homotopy…
We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed…
To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…
Over a monoidal model category, under some mild assumptions, we equip the categories of colored PROPs and their algebras with projective model category structures. A Boardman-Vogt style homotopy invariance result about algebras over…
By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…
We use Polyak's skein relation to give a new proof that Milnor's string link homotopy invariants are finite type invariants, and to develop a recursive relation for their associated weight systems. We show that the obstruction to the…
The paper establishes an equivalence between directed homotopy categories of (diagrams of) cubical sets and (diagrams of) directed topological spaces. This equivalence both lifts and extends an equivalence between classical homotopy…
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
The results of a previous paper on the equivariant homotopy theory of crossed complexes are generalised from the case of a discrete group to general topological groups. The principal new ingredient necessary for this is an analysis of…
We incorporate quandle cocycle information into the quandle coloring quivers we defined in arXiv:1807.10465 to define weighted directed graph-valued invariants of oriented links we call \textit{quandle cocycle quivers}. This construction…
Directed Algebraic Topology is beginning to emerge from various applications. The basic structure we shall use for such a theory, a 'd-space', is a topological space equipped with a family of 'directed paths', closed under some operations.…
Current paper introduces a Hypergraph Graph model of data storage which can be represented as a hybrid data structure based on Hypergraph and Graph. The pro-posed data structure is claimed to realize complex combinatorial structures. The…
A heavy path in a weighted graph represents a notion of connectivity and ordering that goes beyond two nodes. The heaviest path of length l in the graph, simply means a sequence of nodes with edges between them, such that the sum of edge…
We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…