Leavitt path algebras of edge-colored graphs. (Q382048)

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 6228262
Language Label Description Also known as
default for all languages
No label defined
    English
    Leavitt path algebras of edge-colored graphs.
    scientific article; zbMATH DE number 6228262

      Statements

      Leavitt path algebras of edge-colored graphs. (English)
      0 references
      0 references
      18 November 2013
      0 references
      Let \(E\) be a graph and \(R\) a ring, then a Leavitt \(E\)-family in \(R\) is a set \(\{v,e,e^*:v\in E^0,\;e\in E^1,\;e^*\in(E^1)^*\}\subset R\) such that the usual relations \(uv=\delta_{u,v}u\), \(er(e)=e=s(e)e\), \(r(e)e^*=e^*=e^*s(e)\), CK1, CK2, hold for any \(u,v\in E^0\), \(e\in E^1\). An edge-colored graph is a graph \(E=(E^0,E^1,s,r)\) with an edge-coloring map \(d\colon E^1\to\mathbb N\). This will be denoted by \((E,d)\). A Leavitt \((E,d)\)-family in a ring \(R\) is a subset \(\{v,e,e^*:v\in E^0,\;e\in E^1,\;e^*\in(E^1)^*\}\subset R\) such that for any \(i\in\text{rang}(d)\) the set \(E^0\cup d^{-1}(i)\cup(d^{-1}(i))^*\) is a Leavitt \((E^0,d^{-1}(i),r,s)\)-family in \(R\). For a given edge-colored graph \(G=(E,d)\), and a commutative unital ring \(R\), the author defines the Leavitt path algebra of \(G\) with coefficients in \(R\) (denoted \(L_R(G)\)) as the universal \(R\)-algebra generated by a Leavitt \(G\)-family. The paper investigates the way in which \(L_R(G)\) can be written as a certain free product of \(L_R(G_i)\) where the \(G_i\)'s are \(1\)-colored subgraphs of \(G\). It is also proved that \(L_R(G)\) is a free product of simpler algebras. In the final sections of the paper, a natural \(\mathbb Z\)-grading for \(L_R(G)\) is constructed and four necessary conditions for simplicity of \(L_R(G)\) are given.
      0 references
      Leavitt path algebras
      0 references
      edge-colored graphs
      0 references
      simplicity
      0 references
      free products
      0 references

      Identifiers

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