Related papers: Simplicity of 2-graph algebras associated to Dynam…

We construct C*-dynamical systems for the dynamics of classical infinite particle systems describing harmonic oscillators interacting with arbitrarily many neighbors on lattices, as well on more general structures. Our approach allows…

We investigate the ideal structures of the C^*-algebras arising from topological graphs. We give the complete description of ideals of such C^*-algebras which are invariant under the so-called gauge action, and give the condition on…

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

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

We prove that if A is a \sigma-unital exact C*-algebra of real rank zero, then every state on K_0(A) is induced by a 2-quasitrace on A. This yields a generalisation of Rainone's work on pure infiniteness and stable finiteness of crossed…

We define a semidirect product groupoid of a system of partially defined local homeomorphisms $T=(T_{1},..., T_{r})$. We prove that this construction gives rise to amenable groupoids. The associated algebra is a Cuntz-like algebra. We use…

We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…

Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system…

We investigate polynomial endomorphisms of graph $C^*$-algebras and Leavitt path algebras. To this end, we define and analyze the coding graph corresponding to each such an endomorphism. We find an if and only if condition for the…

Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…

A $C^*$-symbolic dynamical system $({\cal A}, \rho, \Sigma)$ is a finite family $\{\rho_\alpha\}_{\alpha \in\Sigma}$ of endomorphisms of a $C^*$-algebra ${\cal A}$ with some conditions. It yields a $C^*$-algebra ${\cal O}_\rho$ from an…

We show that certain C*-algebras which have been studied among others by Arzumanian, Vershik, Deaconu, and Renault in connection to a measure preserving transformation of a measure space and/or to a covering map of a compact space are…

We consider the simplicity of the $C^*$-algebra associated to a labelled space $(E,\CL,\bE)$, where $(E,\CL)$ is a labelled graph and $\bE$ is the smallest accommodating set containing all generalized vertices. We prove that if $C^*(E, \CL,…

Let $G$ be a countable discrete amenable group, and $\Lambda$ be a strongly connected finite $k$-graph. If $(G,\Lambda)$ is a pseudo free and locally faithful self-similar action which satisfies the finite-state condition, then the…

A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $\lambda(G)$ denote the number of such vertices.…

We study families of self-adjoint operators with given spectra whose sum is a scalar operator. Such families are $*$-representations of certain algebras which can be described in terms of graphs and positive functions on them. The main…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…

We study stable finiteness of extensions of 2-graph C*-algebras determined by saturated hereditary sets of vertices. We use two iterations of the Pimsner-Voiculescu sequence to calculate the map in K-theory induced by the inclusion of a…

We give two new conditions on topological $k$-graphs that are equivalent to the Yeend's aperiodicity Condition (A). Each of the new conditions concerns finite paths rather than infinite. We use a specific example, resulting from a new…