The homology of digraphs as a generalization of Hochschild homology. (Q2885392)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6037679
Language Label Description Also known as
default for all languages
No label defined
    English
    The homology of digraphs as a generalization of Hochschild homology.
    scientific article; zbMATH DE number 6037679

      Statements

      23 May 2012
      0 references
      chromatic graph homology
      0 references
      Hochschild homology
      0 references
      directed graphs
      0 references
      The homology of digraphs as a generalization of Hochschild homology. (English)
      0 references
      0 references
      0 references
      The main result of this paper is the construction of a homology theory for digraphs that has connections with Hochschild homology.NEWLINENEWLINE In [Quantum Topol. 1, No. 2, 93-109 (2010; Zbl 1215.57006)], \textit{J. H. Przytycki} described a close connection between \textit{L. Helme-Guizon} and \textit{Y. Rong}'s chromatic graph homology [Algebr. Geom. Topol. 5, 1365-1388 (2005; Zbl 1081.05034)] of a polygon (or cycle) with coefficients in a commutative algebra \(A\), and the Hochschild homology of \(A\); showing that the homology groups agree over a range of dimensions.NEWLINENEWLINE In this paper, the authors define a homology theory for rooted digraphs that has analogous connections with Hochschild homology, but for non-commutative algebras. In more detail, if \(A\) is an algebra, \(M\) is an \(A\)-\(A\) bimodule, and \(\Gamma\) is a rooted digraph, the authors introduce homology groups \(\mathcal H_*(\Gamma,A,M)\). These homology groups have the property that when \(\Gamma\) is a consistently directed \(n\)-gon, then \(\mathcal H_*(\Gamma,A,M)\cong HH_i(A;M)\) for \(0\leq i\leq n-2\), where \(HH_*\) denotes the Hochschild homology.
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references