Related papers: Separating a chart

The symmetrization map $\pi:\mathbb C^2\rightarrow \mathbb C^2$ is defined by $ \pi(z_1,z_2)=(z_1+z_2,z_1z_2). $ The closed symmetrized bidisc $\Gamma$ is the symmetrization of the closed unit bidisc $\overline{\mathbb D^2}$, that is, \[…

Given a labeling c of the edges of a directed graph E by elements of a discrete group G, one can form a skew-product graph E cross_c G. We show, using the universal properties of the various constructions involved, that there is a coaction…

We use the boundary-path space of a finitely-aligned k-graph \Lambda to construct a compactly-aligned product system X, and we show that the graph algebra C^*(\Lambda) is isomorphic to the Cuntz-Nica-Pimsner algebra NO(X). In this setting,…

In this paper we introduce an inverse semigroup $\mathcal{S}(E,C)$ associated to a separated graph $(E,C)$ and describe its internal structure. In particular we show that it is strongly $E^*$-unitary and can be realized as a partial…

Let A be a C*-algebra and d from A into A** be a continuous linear map. We assume that d acts like derivation or anti-derivation at orthogonal elements for several types of orthogonality conditions such as ab=0, ab*=0, ab=ba=0 and…

We consider $C^*$-algebras constructed from compact group actions on complex vector bundles $E\to X$ endowed with a Hermitian metric. An action of $G$ by isometries on $E\to X$ induces an action on the $C^*$-correspondence $\Gamma(E)$ over…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

Let $\mathbf{\Gamma} = (V,E)$ be a (non-trivial) finite graph with $\lambda: E \rightarrow \mathbb{R}_{+}$, an edge labelling of $\mathbf{\Gamma}$. Let $\rho : V\rightarrow \mathbb{R}^{2}$ be a map which preserves the edge labelling. The…

Let $G$ be a discrete group. Given unital $G$-$C^*$-algebras $\mathcal{A}$ and $\mathcal{B}$, we give an abstract condition under which every $G$-subalgebra $\mathcal{C}$ of the form $\mathcal{A}\subset \mathcal{C}\subset…

We provide a complete classification of the class of unital graph $C^*$-algebras - prominently containing the full family of Cuntz-Krieger algebras - showing that Morita equivalence in this case is determined by ordered, filtered…

We characterize covariant positive decomposable maps between unital C*-algebras in terms of a dilation theorem, which generalizes a seminal result by H. Scutaru from Rep. Math. Phys. 16 (1):79-87, 1979. As a case study, we provide a certain…

Let $G$ be a second countable, locally compact groupoid with Haar system, and let $\mathcal{A}$ be a bundle of $C^{\ast}$-algebras defined over the unit space of $G$ on which $G$ acts continuously. We determine conditions under which the…

A Mauldin-Williams graph $\mathcal{M}$ is a generalization of an iterated function system by a directed graph. Its invariant set $K$ plays the role of the self-similar set. We associate a $C^{*}$-algebra $\mathcal{O}_{\mathcal{M}}(K)$ with…

Let $G \curvearrowright A$ be an action of a discrete group on a unital $C^*$-algebra by $*$-automorphisms. In this note, we give two sufficient dynamical conditions for the $C^*$-inclusion $A \subseteq A \rtimes_r G$ to be norming in the…

Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and…

The $\gamma$-graph of a graph $G$ is the graph whose vertices are labelled by the minimum dominating sets of $G$, in which two vertices are adjacent when their corresponding minimum dominating sets (each of size $\gamma(G)$) intersect in a…

Let $G$ be a discrete group and let $\mathcal A$ and $\mathcal B$ be two subgroups of $G$-valued continuous functions defined on two $0$-dimensional compact spaces $X$ and $Y$. A group isomorphism $H$ defined between $\mathcal A$ and…

An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

The purpose of this short note is to clarify and present a general version of an interesting observation by Piani and Mora (Physic. Rev. A 75, 012305 (2007)), linking complete positivity of linear maps on matrix algebras to decomposability…