Path homology of digraphs without multisquares and its comparison with homology of spaces

Abstract

For a digraph G without multisquares and a field F, we construct a basis of the vector space of path n-chains n(G;F) for n≥ 0, generalising the basis of 3(G;F) constructed by Grigory'an. For a field F, we consider the F-path Euler characteristic F(G) of a digraph G defined as the alternating sum of dimensions of path homology groups with coefficients in F. If (G;F) is a bounded chain complex, the constructed bases can be applied to compute F(G). We provide an explicit example of a digraph G whose F-path Euler characteristic depends on whether the characteristic of F is two, revealing the differences between GLMY theory and the homology theory of spaces. This allows us to prove that there is no topological space X whose homology is isomorphic to path homology of the digraph H*(X;K) PH*(G;K) simultaneously for K=Z and K=Z/2Z.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…