Path homology of digraphs without multisquares and its comparison with homology of spaces
Xin Fu, Sergei O. Ivanov

TL;DR
This paper develops a basis for path homology of digraphs without multisquares, compares it with space homology, and shows differences depending on the field characteristic, highlighting limitations of topological space models.
Contribution
It constructs explicit bases for path homology of certain digraphs and analyzes how the Euler characteristic varies with field characteristic, revealing fundamental differences from classical space homology.
Findings
Constructed bases for path homology of digraphs without multisquares.
Demonstrated Euler characteristic dependence on field characteristic.
Proved no topological space can match path homology over both Z and Z/2Z.
Abstract
For a digraph without multisquares and a field , we construct a basis of the vector space of path -chains for , generalising the basis of constructed by Grigory'an. For a field we consider the -path Euler characteristic of a digraph defined as the alternating sum of dimensions of path homology groups with coefficients in If is a bounded chain complex, the constructed bases can be applied to compute . We provide an explicit example of a digraph whose -path Euler characteristic depends on whether the characteristic of is two, revealing the differences between GLMY theory and the homology theory of spaces. This allows us to prove that there is no topological…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
