Multipath cohomology of directed graphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Caputi, Luigi, Collari, Carlo, Di Trani, Sabino
Format: Preprint
Published: 2021
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929645486604288
author Caputi, Luigi
Collari, Carlo
Di Trani, Sabino
author_facet Caputi, Luigi
Collari, Carlo
Di Trani, Sabino
contents This work is part of a series of papers focusing on multipath cohomology of directed graphs. Multipath cohomology is defined as the (poset) homology of the path poset -- i.e., the poset of disjoint simple paths in a graph -- with respect to a certain functor. This construction is essentially equivalent, albeit more computable, to taking the higher limits of said functor on (a certain modification of) the path poset. We investigate the functorial properties of multipath cohomology. We provide a number of sample computations, show that the multipath cohomology does not vanish on trees, and that, when evaluated at the coherently oriented polygon, it recovers Hochschild homology. Finally, we use the same techniques employed to study the functoriality to investigate the connection with the chromatic homology of (undirected) graphs introduced by L. Helme-Guizon and Y. Rong.
format Preprint
id arxiv_https___arxiv_org_abs_2108_02690
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle Multipath cohomology of directed graphs
Caputi, Luigi
Collari, Carlo
Di Trani, Sabino
Algebraic Topology
Combinatorics
18G85, 05C20, 13D03
This work is part of a series of papers focusing on multipath cohomology of directed graphs. Multipath cohomology is defined as the (poset) homology of the path poset -- i.e., the poset of disjoint simple paths in a graph -- with respect to a certain functor. This construction is essentially equivalent, albeit more computable, to taking the higher limits of said functor on (a certain modification of) the path poset. We investigate the functorial properties of multipath cohomology. We provide a number of sample computations, show that the multipath cohomology does not vanish on trees, and that, when evaluated at the coherently oriented polygon, it recovers Hochschild homology. Finally, we use the same techniques employed to study the functoriality to investigate the connection with the chromatic homology of (undirected) graphs introduced by L. Helme-Guizon and Y. Rong.
title Multipath cohomology of directed graphs
topic Algebraic Topology
Combinatorics
18G85, 05C20, 13D03
url https://arxiv.org/abs/2108.02690