Hostname: page-component-7dd5485656-pnlb5 Total loading time: 0.001 Render date: 2025-10-31T16:56:56.346Z Has data issue: false hasContentIssue false
  • English
  • Français

A family of 2-graphs arising from two-dimensional subshifts

Published online by Cambridge University Press:  12 March 2009

DAVID PASK ,
IAIN RAEBURN  and
NATASHA A. WEAVER
DAVID PASK
Affiliation:
School of Mathematics and Applied Statistics, University of Wollongong, NSW 2522, Australia (email: dpask@uow.edu.au, raeburn@uow.edu.au)
IAIN RAEBURN
Affiliation:
School of Mathematics and Applied Statistics, University of Wollongong, NSW 2522, Australia (email: dpask@uow.edu.au, raeburn@uow.edu.au)
NATASHA A. WEAVER
Affiliation:
School of Mathematical and Physical Sciences, University of Newcastle, NSW 2308, Australia (email: Natasha.Weaver@studentmail.newcastle.edu.au)
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 29 , Issue 5 , October 2009 , pp. 1613 - 1639
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Bosma, W., Cannon, J. and Playoust, C.. The Magma algebra system. I. The user language. J. Symbolic Comput. 24 (1997), 235–265.CrossRefGoogle Scholar
[2]Davidson, K. R., Power, S. C. and Yang, D.. Dilation theory for rank 2 graph algebras. J. Operator Theory arXiv:0705.4496 [math.OA], to appear.Google Scholar
[3]Davis, P. J.. Circulant Matrices, 2nd edn. Chelsea, New York, 1994.Google Scholar
[4]Evans, D. G.. On the K-theory of higher rank graph C *-algebras. New York J. Math. 14 (2008), 1–31.Google Scholar
[5]Gradshteyn, I. S. and Ryzhik, I. M.. Tables of Integrals, Series and Products, 6th edn. Academic Press, San Diego, 2000, pp. 1111–1112.Google Scholar
[6]Kirchberg, E.. Exact C *-algebras, Tensor Products, and the Classification of Purely Infinite Algebras (Proceeding of the International Congress in Mathematics, 1). Birkhäuser, Basel, 1995, pp. 943–954.Google Scholar
[7]Kitchens, B. and Schmidt, K.. Mixing sets and relative entropies for higher-dimensional Markov shifts. Ergod. Th. & Dynam. Sys. 13 (1993), 705–735.CrossRefGoogle Scholar
[8]Kribs, D. W. and Power, S. C.. The analytic algebras of higher rank graphs. Math. Proc. R. Ir. Acad. 106 (2006), 199–218.CrossRefGoogle Scholar
[9]Kumjian, A. and Pask, D.. Higher rank graph C *-algebras. New York J. Math. 6 (2000), 1–20.Google Scholar
[10]Kumjian, A. and Pask, D.. Actions of Z k associated to higher rank graphs. Ergod. Th. & Dynam. Sys. 23 (2003), 1153–1172.CrossRefGoogle Scholar
[11]Ledrappier, F.. Un champ markovian peut être d’entropie nulle et melangéant. C.R. Acad. Sci. Paris Sér. I Math. 287 (1978), 561–562.Google Scholar
[12]Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.CrossRefGoogle Scholar
[13]Lind, D. and Schmidt, K.. Symbolic and Algebraic Dynamical Systems (Handbook of Dynamical Systems, 1A). North-Holland, Amsterdam, 2002, pp. 765–812.Google Scholar
[14]Mann, M. H., Raeburn, I. and Sutherland, C. E.. Representations of finite groups and Cuntz–Krieger algebras. Bull. Austral. Math. Soc. 46 (1992), 225–243.CrossRefGoogle Scholar
[15]Pask, D., Raeburn, I., Rordam, M. and Sims, A.. Rank-two graphs whose C *-algebras are direct limits of circle algebras. J. Funct. Anal. 239 (2006), 137–178.CrossRefGoogle Scholar
[16]Pask, D., Rennie, A. and Sims, A.. The noncommutative geometry of graph C *-algebras. J. K-Theory 1 (2008), 259–304.CrossRefGoogle Scholar
[17]Pask, D., Rennie, A. and Sims, A.. Noncommutative manifolds from graph and k-graph C *-algebras, Comm. Math. Phys., arXiv:/0701527[math.OA] to appear.Google Scholar
[18]Phillips, N. C.. A classification theorem for nuclear purely infinite simple C *-algebras. Doc. Math. 5 (2000), 49–114.CrossRefGoogle Scholar
[19]Popescu, I. and Zacharias, J.. E-theoretic duality for higher rank graph algebras. K-Theory 34 (2005), 265–282.CrossRefGoogle Scholar
[20]Raeburn, I.. Graph Algebras (CBMS Regional Conference Series in Mathematics, 103). American Mathematical Society, Providence, RI, 2005.CrossRefGoogle Scholar
[21]Raeburn, I., Sims, A. and Yeend, T.. Higher-rank graphs and their C *-algebras. Proc. Edinb. Math. Soc. 46 (2003), 99–115.CrossRefGoogle Scholar
[22]Robertson, D. I. and Sims, A.. Simplicity of C *-algebras associated to higher rank graphs. Bull. London Math. Soc. 39 (2007), 337–344.CrossRefGoogle Scholar
[23]Robertson, G. and Steger, T.. Affine buildings, tiling systems and higher rank Cuntz–Krieger algebras. J. Reine Angew. Math. 513 (1999), 115–144.CrossRefGoogle Scholar
[24]Robertson, G. and Steger, T.. Asymptotic K-theory for groups acting on buildings. Canad. J. Math. 53 (2001), 809–833.CrossRefGoogle Scholar
[25]Rørdam, M.. Classification of Nuclear, Simple C *-Algebras (Encyclopedia of Mathematical Science, 126). Springer, 2002, pp. 1–145.Google Scholar
[26]Schmidt, K.. Dynamical Systems of Algebraic Origin (Progress in Mathematics, 128). Birkhäuser, Basel, 1995.Google Scholar
[27]Sims, A.. Gauge-invariant ideals in the C *-algebras of finitely aligned higher-rank graphs. Canad. J. Math. 58 (2006), 1268–1290.CrossRefGoogle Scholar