Λ
r
s
d:Λ\toNk
d(λ)=m+n
\mu,\nu\inΛ
d(\mu)=m,d(\nu)=n
λ=\mu\nu
Aside from its category theory definition, one can think of k-graphs as a higher-dimensional analogue of directed graphs (digraphs). k- here signifies the number of "colors" of edges that are involved in the graph. If k=1, a k-graph is just an ordinary directed graph.If k=2, there are two different colors of edges involved in the graph and additional factorization rules of 2-color equivalent classes should be defined. The factorization rule on k-graph skeleton is what distinguishes one k-graph defined on the same skeleton from another k-graph. k can be any natural number greater than or equal to 1.
The reason k-graphs were first introduced by Kumjian, Pask et al. was to create examples of C*-algebras from them. k-graphs consist of two parts: skeleton and factorization rules defined on the given skeleton. Once k-graph is well-defined, one can define functions called 2-cocycles on each graph, and C*-algebras can be built from k-graphs and 2-cocycles. k-graphs are relatively simple to understand from a graph theory perspective, yet just complicated enough to reveal different interesting properties at the C*-algebra level. The properties such as homotopy and cohomology on the 2-cocycles defined on k-graphs have implications to C*-algebra and K-theory research efforts. No other known use of k-graphs exist to this day; k-graphs are studied solely for the purpose of creating C*-algebras from them.
The finite graph theory in a directed graph form a category under concatenation called the free object category (generated by the graph). The length of a path in
E
N
Tk
{f1,...,fk}
d:Tk\toNk
n1 | |
d(f | |
1 |
nk | |
...f | |
k |
)=(n1,\ldots,nk)
\Omegak=\{(m,n):m,n\inZk,m\len\}
\Omegak
r(m,n)=(m,m)
s(m,n)=(n,n)
(m,n)(n,p)=(m,p)
d(m,n)=n-m
The notation for k-graphs is borrowed extensively from the corresponding notation for categories:
n\inNk
Λn=d-1(n)
Λ0=\operatorname{Obj}(Λ)
v,w\inΛ0
X\subseteqΛ
vX=\{λ\inX:r(λ)=v\}
Xw=\{λ\inX:s(λ)=w\}
vXw=vX\capXw
0<\#vΛn<infty
v\inΛ0
n\inNk
Λ
E=(E0,E1,r,s,c)
E0=Λ0
E1=
k | |
\cup | |
i=1 |
ei | |
Λ |
r,s
Λ
c:E1\to\{1,\ldots,k\}
c(e)=i
e\in
ei | |
Λ |
e1,\ldots,en
Nk
Λ
ei+ej
i ≠ j
E
As with graph-algebras one may associate a C*-algebra to a k-graph:
Let
Λ
Λ
\{sλ:λ\inΛ\}
sλs\mu=sλ
λ,\mu,λ\mu\inΛ
\{sv:v\inΛ0\}
d(\mu)=d(\nu)
* | |
s | |
\mu |
s\nu=\delta\muss
sv=
\sum | |
λ\invΛn |
sλ
* | |
s | |
λ |
n\inNk
v\inΛ0
C*(Λ)
Λ