相关论文: Simplicity of 2-graph algebras associated to Dynam…

Automata networks can be seen as bare finite dynamical systems, but their growing theory has shown the importance of the underlying communication graph of such networks. This paper tackles the question of what dynamics can be realized up to…

We introduce the notion of continuous orbit equivalence for partial dynamical systems, and give an equivalent characterization in terms of Cartan-isomorphisms for partial C*-crossed products. Both graph C*-algebras and semigroup C*-algebras…

We characterize relatively hyperbolic groups whose reduced $C^*$-algebra is simple as those, which have no non-trivial finite normal subgroups.

We verify the conjecture on continuous-trace subquotients for $C^*$-algebras of nilpotent linear dynamical systems, where by linear dynamical system we mean a continuous action of the additive group of real numbers by linear maps on a…

We define a categorical framework in which we build a systematic construction that provides generic invariants for C*-algebras. The benefit is significant as we show that any invariant arising this way automatically enjoys nice properties…

Let $R$ be a rational function. The iterations $(R^n)_n$ of $R$ gives a complex dynamical system on the Riemann sphere. We associate a $C^*$-algebra and study a relation between the $C^*$-algebra and the original complex dynamical system.…

We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…

There are many classes of nonsimple graph C*-algebras that are classified by the six-term exact sequence in K-theory. In this paper we consider the range of this invariant and determine which cyclic six-term exact sequences can be obtained…

In this paper, we consider the gauge-invariant ideal structure of a $C^*$-algebra $C^*(E,\mathcal{L},\mathcal{B})$ associated to a set-finite, receiver set-finite and weakly left-resolving labelled space $(E,\mathcal{L},\mathcal{B})$, where…

Given a finitely aligned $k$-graph $\Lambda$, we let $\Lambda^i$ denote the $(k-1)$-graph formed by removing all edges of degree $e_i$ from $\Lambda$. We show that the Toeplitz-Cuntz-Krieger algebra of $\Lambda$, denoted by…

We show that if A is a separable, nuclear, O_infty-absorbing (or strongly purely infinite) C*-algebra, which is homotopic to zero in an ideal-system preserving way, then A is the inductive limit of C*-algebras of the form M_k(C_0(G,v)),…

M. Carr and S. Devadoss introduced in [7] the notion of tubing on a finite simple graph $\Gamma$, in the context of configuration spaces on the Hilbert plane. To any finite simple graph $\Gamma$ they associated a finite partially ordered…

Let $P$ be a finitely generated cancellative abelian monoid. A $P$-graph $\Lambda$ is a natural generalization of a higher rank graph. A pullback of $\Lambda$ is constructed by pulling it back over a given monoid morphism to $P$, while a…

In this paper, we introduce a C*-algebra associated to any substitution (via its Bratteli diagram model). We show that this C*-algebra contains the partial crossed product C*-algebra of the corresponding Bratteli-Vershik system and show…

A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…

Let $G = (V, E)$ be a graph and $\lambda $ a non-negative integer. A graph $G$ is called a $(\lambda, 1)$-{\em graph} if $ (c0)$ $G$ is neither a complete graph no an edge-empty graph, $ (c1)$ every edge in $G$ belongs to exactly $\lambda$…

We show that, if a simple $C^{*}$-algebra $A$ is topologically finite-dimensional in a suitable sense, then not only $K_{0}(A)$ has certain good properties, but $A$ is even accessible to Elliott's classification program. More precisely, we…

In this paper we describe a new method of defining C*-algebras from oriented combinatorial data, thereby generalizing the constructions of algebras from directed graphs, higher-rank graphs, and ordered groups. We show that only the most…

We develop notions of a representation of a topological graph E and of a covariant representation of a topological graph E which do not require the machinery of C*-correspondences and Cuntz-Pimsner algebras. We show that the C*-algebra…

We give a complete $K$-theoretical description of when an extension of two simple graph $C^{*}$-algebras is again a graph $C^{*}$-algebra.