REVIEW 4 cited by
Path homology of digraphs without multisquares and its comparison with homology of spaces
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
For a digraph $G$ without multisquares and a field $\mathbb{F}$, we construct a basis of the vector space of path $n$-chains $\Omega_n(G;\mathbb{F})$ for $n\geq 0$, generalising the basis of $\Omega_3(G;\mathbb{F})$ constructed by Grigory'an. For a field $\mathbb{F},$ we consider the $\mathbb{F}$-path Euler characteristic $\chi^\mathbb{F}(G)$ of a digraph $G$ defined as the alternating sum of dimensions of path homology groups with coefficients in $\mathbb{F}.$ If $\Omega_\bullet(G;\mathbb{F})$ is a bounded chain complex, the constructed bases can be applied to compute $\chi^\mathbb{F}(G)$. We provide an explicit example of a digraph $\mathcal{G}$ whose $\mathbb{F}$-path Euler characteristic depends on whether the characteristic of $\mathbb{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;\mathbb{K})\cong {\rm PH}_*(\mathcal{G};\mathbb{K})$ simultaneously for $\mathbb{K}=\mathbb{Z}$ and $\mathbb{K}=\mathbb{Z}/2\mathbb{Z}.$
Forward citations
Cited by 4 Pith papers
-
Inductive construction of path homology chains
New inductive elements, built from face multihypergraphs, generate the path homology chain modules over finite fields and produce digraphs whose path Euler characteristic changes with the coefficient field.
-
Inductive construction of path homology chains and the structure of $\Omega_3(G;R)$
Path homology chains of any digraph are generated by inductive extensions over face multigraphs: completely in characteristic 2 and in dimensions 0–3 in characteristic 0.
-
Primitive path homology
Primitive path homology is a new digraph invariant that coincides with GLMY path homology on asymmetric digraphs and differs on symmetric ones.
-
Stability of persistent path homology of path complexes
The claimed stability of persistent path homology for arbitrary path complexes is unsupported because the key homotopy argument assumes path complexes are closed under concatenation.
Discussion (0). Continue with ORCID to comment.