Simplicity of C*‐algebras associated to higher‐rank graphs

@article{Robertson2006SimplicityOC,
  title={Simplicity of C*‐algebras associated to higher‐rank graphs},
  author={David I. Robertson and Aidan Sims},
  journal={Bulletin of the London Mathematical Society},
  year={2006},
  volume={39}
}
  • D. RobertsonA. Sims
  • Published 7 February 2006
  • Mathematics
  • Bulletin of the London Mathematical Society
We prove that if Λ is a row‐finite k‐graph with no sources, then the associated C*‐algebra is simple if and only if Λ is cofinal and satisfies Kumjian and Pask's aperiodicity condition, known as Condition (A). We prove that the aperiodicity condition is equivalent to a suitably modified version of Robertson and Steger's original nonperiodicity condition (H3), which in particular involves only finite paths. We also characterise both cofinality and aperiodicity of Λ in terms of ideals in C*(Λ). 

Simplicity of C*-algebras associated to row-finite locally convex higher-rank graphs

In a previous work, the authors showed that the C*-algebra C*(Λ) of a row-finite higher-rank graph Λ with no sources is simple if and only if Λ is both cofinal and aperiodic. In this paper, we

K-theory for real k-graph C∗-algebras

. We initiate the study of real C ∗ -algebras associated to higher-rank graphs Λ, with a focus on their K -theory. Following Kasparov and Evans, we identify a spectral sequence which computes the CR

Type III von Neumann algebras associated with 2‐graphs

Let 픽θ+ be a 2‐graph, where θ is a permutation encoding the factorization property in the 2‐graph, and ω be a distinguished faithful state associated with its graph C*‐algebra. In this paper, we

Aperiodicity and cofinality for finitely aligned higher-rank graphs†

  • P. LewinA. Sims
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 2010
Abstract We introduce new formulations of aperiodicity and cofinality for finitely aligned higher-rank graphs Λ, and prove that C*(Λ) is simple if and only if Λ is aperiodic and cofinal. The main

Factoriality and Type Classification of k-Graph von Neumann Algebras

  • Dilian Yang
  • Mathematics
    Proceedings of the Edinburgh Mathematical Society
  • 2016
Abstract Let be a single vertex k-graph and let be the von Neumann algebra induced from the Gelfand–Naimark–Segal (GNS) representation of a distinguished state ω of its k-graph C*-algebra . In this

AF-embeddability of 2-graph algebras and stable finiteness of k-graph algebras

We characterise stable finiteness of the C*-algebra of a cofinal k-graph in terms of an algebraic condition involving the coordinate matrices of the graph. This result covers all simple k-graph

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

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

Simplicity of twisted C*-algebras of higher-rank graphs and crossed products by quasifree actions

We characterise simplicity of twisted C*-algebras of row-finite k-graphs with no sources. We show that each 2-cocycle on a cofinal k-graph determines a canonical second-cohomology class for the

Irreducibility and monicity for representations of $k$-graph $C^*$-algebras

The representations of a k-graph C∗-algebra C∗(Λ) which arise from Λ-semibranching function systems are closely linked to the dynamics of the k-graph Λ. In this paper, we undertake a systematic

Uniqueness theorems for topological higher-rank graph C*-algebras

We consider the boundary-path groupoids of topological higher-rank graphs. We show that the all such groupoids are topologically amenable. We deduce that the C*-algebras of topological higher-rank
...

References

SHOWING 1-10 OF 13 REFERENCES

* -algebras of Finitely Aligned Higher-rank Graphs

We generalise the theory of Cuntz-Krieger families and graph algebras to the class of finitely aligned k-graphs. This class contains in particular all row-finite k-graphs. The Cuntz-Krieger relations

HIGHER-RANK GRAPHS AND THEIR $C^*$-ALGEBRAS

Abstract We consider the higher-rank graphs introduced by Kumjian and Pask as models for higher-rank Cuntz–Krieger algebras. We describe a variant of the Cuntz–Krieger relations which applies to

On higher rank graph C ∗ -algebras

Given a row-finite k-graph Λ with no sources we investigate the K-theory of the higher rank graph C *-algebra, C * (Λ). When k = 2 we are able to give explicit formulae to calculate the K-groups of C

Affine buildings, tiling systems and higher rank Cuntz-Krieger algebras

To an $r$-dimensional subshift of finite type satisfying certain special properties we associate a $C^*$-algebra $\cA$. This algebra is a higher rank version of a Cuntz-Krieger algebra. In

Gauge-Invariant Ideals in the C*-Algebras of Finitely Aligned Higher-Rank Graphs

  • A. Sims
  • Mathematics
    Canadian Journal of Mathematics
  • 2006
Abstract We produce a complete description of the lattice of gauge-invariant ideals in ${{C}^{*}}(\Lambda )$ for a finitely aligned $k$ -graph $\Lambda $ . We provide a condition on $\Lambda $ under

CUNTZ-KRIEGER ALGEBRAS OF DIRECTED GRAPHS

We associate to each row-nite directed graph E a universal Cuntz-Krieger C-algebra C(E), and study how the distribution of loops in E aects the structure of C(E) .W e prove that C(E) is AF if and

Graphs, Groupoids, and Cuntz–Krieger Algebras

We associate to each locally finite directed graphGtwo locally compact groupoidsGandG(★). The unit space ofGis the space of one–sided infinite paths inG, andG(★) is the reduction ofGto the space of

THE C -ALGEBRAS OF ROW-FINITE GRAPHS

NSKI Abstract. We prove versions of the fundamental theorems about Cuntz-Krieger algebras for the C -algebras of row-finite graphs: directed graphs in which each vertex emits at most finitely many

The C^*-algebras of infinite graphs

::: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ::: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .