Related papers: Stability of C*-algebras associated to graphs

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G)+mu(G) equals its order, then G is a Konig-Egervary graph. In this paper…

In this article, we prove $K$-stability for a family of $C^*$-algebras, which are generated by a finite set of unitaries and isometries satisfying twisted commutation relations. This family includes the $C^*$-algebra of doubly non-commuting…

Let $c$ and $c'$ be edge or vertex colourings of a graph $G$. We say that $c'$ is less symmetric than $c$ if the stabiliser (in $\operatorname{Aut} G$) of $c'$ is contained in the stabiliser of $c$. We show that if $G$ is not a bicentred…

A C*-algebra is n-homogeneous (where n is finite) if every its nonzero irreducible representation acts on an n-dimensional Hilbert space. An elementary proof of Fell's characterization of n-homogeneous C*-algebras (by means of their…

We prove that if $G$ is a graph and $f(v) \leq 1/(d(v) + 1/2)$ for each $v\in V(G)$, then either $G$ has an independent set of size at least $\sum_{v\in V(G)}f(v)$ or $G$ contains a clique $K$ such that $\sum_{v\in K}f(v) > 1$. This result…

We consider for two based graphs $G$ and $H$ the sequence of graphs $G_k$ given by the wedge sum of $G$ and $k$ copies of $H$. These graphs have an action of the symmetric group $\Sigma_k$ by permuting the $H$-summands. We show that the…

Given a C$^*$-correspondence $X$, we give necessary and sufficient conditions for the tensor algebra $\mathcal T_X^+$ to be hyperrigid. In the case where $X$ is coming from a topological graph we obtain a complete characterization.

When $\mathcal D$ is strongly self-absorbing we say an inclusion $B \subseteq A$ is $\mathcal D$-stable if it is isomorphic to the inclusion $B \otimes \mathcal D \subseteq A \otimes \mathcal D$. We give ultrapower characterizations and…

We prove that separable C*-algebras which are completely close in a natural uniform sense have isomorphic Cuntz semigroups, continuing a line of research developed by Kadison - Kastler, Christensen, and Khoshkam. This result has several…

For an arbitrary invariant $\rho (G)$ of a graph $G$, the $\rho-$vertex stability number $vs_{\rho}(G)$ is the minimum number of vertices of $G$ whose removal results in a graph $H\subseteq G$ with $\rho (H)\neq \rho (G)$ or with…

We classify spectrum-preserving endomorphisms of stable continuous-trace C^*-algebras up to inner automorphism by a surjective multiplicative invariant taking values in finite dimensional vector bundles over the spectrum. Specializing to…

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…

A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…

A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characterize graphs in which every maximal matching saturates all…

A vertex in a graph is said to be sedentary if a quantum state assigned on that vertex tends to stay on that vertex. Under mild conditions, we show that the direct product and join operations preserve vertex sedentariness. We also…

We introduce a graph theoretic property called Condition (N) for finitely separated graphs and prove that it is equivalent to both nuclearity and exactness of the associated universal tame graph C*-algebra.

In this paper we generalize a theorem of M. Hilsum and G. Skandalis stating that the $C^*$- algebra of any foliation of non zero dimension is stable. Precisely, we show that the C*-algebra of a Lie groupoid is stable whenever the groupoid…

In this paper we generalize the notion of a $k$-graph into (countable) infinite rank. We then define our $C^*$-algebra in a similar way as in $k$-graph $C^*$-algebras. With this construction we are able to find analogues to the Gauge…

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…

It is proved that the reduced group C*-algebra C*_{red}(G) has stable rank one (i.e. its group of invertible elements is a dense subset) if G is a discrete group arising as a free product G_1*G_2 where |G_1|>=2 and |G_2|>=3. This follows…