Related papers: Stability of C*-algebras associated to graphs
A C*-algebra is said to be K-stable if its nonstable K-groups are naturally isomorphic to the usual K-theory groups. We study continuous $C(X)$-algebras, each of whose fibers are K-stable. We show that such an algebra is itself K-stable…
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also…
We prove that a graph C*-algebra with exactly one proper nontrivial ideal is classified up to stable isomorphism by its associated six-term exact sequence in K-theory. We prove that a similar classification also holds for a graph C*-algebra…
The stability number of a graph G, denoted by alpha(G), is the cardinality of a stable set of maximum size in G. A graph is well-covered if every maximal stable set has the same size. G is a Koenig-Egervary graph if its order equals…
We introduce a divisibility-type condition for directed graphs that is necessary for $\mathcal{Z}$-stability of the corresponding graph $C^*$-algebra. We prove that this condition is sufficient if either the graph $E$ has no cycles or the…
For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…
A group may be considered $C^*$-stable if almost representations of the group in a $C^*$-algebra are always close to actual representations. We initiate a systematic study of which discrete groups are $C^*$-stable or only stable with…
Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…
A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…
We prove some stability results for certain classes of C*-algebras. We prove that whenever $A$ is a finite-dimensional C*-algebra, $B$ is a C*-algebra and $\phi\colon A\to B$ is approximately a $^*$-homomorphism then there is an actual…
We show that a separable C*-algebra $A$ is $\mathcal{Z}$-stable if and only if its uncorrected central sequence algebra $A' \cap A_{\mathcal{U}}$ is pure, if and only if Kirchberg's central sequence algebra $F(A)$ is pure. More generally,…
Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…
We consider tracial stability, which requires that tuples of elements of a C*-algebra with a trace that nearly satisfy the relation are close to tuples that actually satisfy the relation. Here both "near" and "close" are in terms of the…
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 describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…
The stability number of a graph G, is the cardinality of a stable set of maximum size in G. If the stability number of G remains the same upon the addition of any edge, then G is called $\alpha ^{+}$-stable. G is a K\"{o}nig-Egervary graph…
We show that the class of C*-algebras with stable rank greater than a given positive integer is axiomatizable in logic of metric structures. As a consequence we show that the stable rank is continuous with respect to forming ultrapowers of…
Pure infiniteness (in sense of E.Kirchberg and M.R{\o}rdam) is considered for C*-algebras arising from singly generated dynamical systems. In particular, Cuntz-Krieger algebras and their generalizations, i.e., graph-algebras and O_A of an…