Related papers: Separating a chart

Let E be a product system of C*-correspondences over N^r. Some sufficient conditions for the existence of a not necessarily regular isometric dilation of a completely contractive representation of E are established and difference between…

In this paper we study free actions of groups on separated graphs and their \cstar{}algebras, generalizing previous results involving ordinary (directed) graphs. We prove a version of the Gross-Tucker Theorem for separated graphs yielding a…

We characterize when there exists a diagonal preserving $*$-isomorphism between two graph $C^*$-algebras in terms of the dynamics of the boundary path spaces. In particular, we refine the notion of "orbit equivalence" between the boundary…

Given a unital $\boldsymbol{C}^{*}$-algebra $\mathcal{A}$, we prove the existence of the coproduct of two faithful operator $\mathcal{A}$-systems. We show that we can either consider it as a subsystem of an amalgamated free product of…

We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

The co-maximal subgroup graph $\Gamma(G)$ of a group $G$ is a graph whose vertices are non-trivial proper subgroups of $G$ and two vertices $H$ and $K$ are adjacent if $HK=G$. In this paper, we continue the study of $\Gamma(G)$, especially…

Let $G$ be a simple and finite graph. A graph is said to be \textit{decomposed} into subgraphs $H_1$ and $H_2$ which is denoted by $G= H_1 \oplus H_2$, if $G$ is the edge disjoint union of $H_1$ and $H_2$. If $G= H_1 \oplus H_2 \oplus H_3…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Let $A$ be a finite group acting by automorphisms on the finite group $G$. We introduce the commuting graph $\Gamma (G,A)$ of this action and study some questions related to the structure of $G$ under certain graph theoretical conditions on…

Let $\gamma = (\gamma_1,...,\gamma_N)$, $N \geq 2$, be a system of proper contractions on a complete metric space. Then there exists a unique self-similar non-empty compact subset $K$. We consider the union ${\mathcal G} = \cup_{i=1}^N…

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 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…

If $G$ is a graph then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$ where $d$ is the distance function. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

Let $\alpha : \Gamma \curvearrowright A$ be an action of a discrete group $\Gamma$ on a unital C*-algebra $A$ by *-automorphisms and let $A \rtimes_{\alpha,\lambda} \Gamma$ denote the corresponding reduced crossed product C*-algebra.…

We define the action of a locally compact group $G$ on a topological graph $E$. This action induces a natural action of $G$ on the $C^*$-correspondence ${\mathcal H}(E)$ and on the graph $C^*$-algebra $C^*(E)$. If the action is free and…

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.

We study dilations of finite tuples of normal, completely positive and completely contractive maps (which we call CP-maps) acting on a von Neumann algebra, and commuting according to a graph G. We show that if G is acyclic, then a tuple…

We attach to each finite bipartite separated graph (E,C) a partial dynamical system (\Omega(E,C), F, \theta), where \Omega(E,C) is a zero-dimensional metrizable compact space, F is a finitely generated free group, and {\theta} is a…