A family of 2-graphs arising from two-dimensional subshifts
classification
🧮 math.OA
math.DS
keywords
graphsalgebrasfamilyfindhigher-rankwhosealgebraicanalyse
read the original abstract
Higher-rank graphs (or $k$-graphs) were introduced by Kumjian and Pask to provide combinatorial models for the higher-rank Cuntz-Krieger $C^*$-algebras of Robertson and Steger. Here we consider a family of finite 2-graphs whose path spaces are dynamical systems of algebraic origin, as studied by Schmidt and others. We analyse the $C^*$-algebras of these 2-graphs, find criteria under which they are simple and purely infinite, and compute their $K$-theory. We find examples whose $C^*$-algebras satisfy the hypotheses of the classification theorem of Kirchberg and Phillips, but are not isomorphic to the $C^*$-algebras of ordinary directed graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.