Related papers: Separating a chart
Let $G=(V, E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal C}$ be an arrangement of disks with a bijection between the disks…
We study the notions of continuous orbit equivalence and eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs with finitely many vertices and no sinks or sources. We…
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensonal braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…
We describe simplicity of the Stacey crossed product A\times_\beta \N in terms of conditions of the endomorphism \beta. Then, we use a characterization of the graph C*-algebras C*(E) as the Stacey crossed product…
We prove what might have been expected: The Williams Conjecture in symbolic dynamics and Graded Morita Equivalence Conjecture for Leavitt/$C^*$-graph algebras hold for ``small graphs'', i.e., connected graphs with three vertices, no…
This paper is a continuation of the paper entitled "Subshifts, $\lambda$-graph bisystems and $C^*$-algebras", arXiv:1904.06464. A $\lambda$-graph bisystem consists of a pair of two labeled Bratteli diagrams satisfying certain compatibility…
The deck of a graph $X$, $D(X)$, is defined as the multiset of all vertex-deleted subgraphs of $X$. Two graphs are said to be hypomorphic, if they have the same deck. Kelly-Ulam conjecture states that any two hypomorphic graphs on at least…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
Consider a projective limit G of finite groups G_n. Fix a compatible family \delta^n of coactions of the G_n on a C*-algebra A. From this data we obtain a coaction \delta of G on A. We show that the coaction crossed product of A by \delta…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…
The purpose of this paper is to introduce a consistent notion of universal and reduced crossed products by actions and coactions of groups on operator systems and operator spaces. In particular we shall put emphasis to reveal the full power…
A $C^*$-textile dynamical system $({\cal A}, \rho,\eta,\Sigma^\rho,\Sigma^\eta, \kappa)$ connsists of a unital $C^*$-algebra ${\cal A}$, two families of endomorphisms ${\rho_\alpha}_{\alpha \in \Sigma^\rho}$ and ${\eta_a}_{a \in…
For any countable graph $E$, we investigate the relationship between the Leavitt path algebra $L_{\C}(E)$ and the graph C*-algebra $C^*(E)$. For graphs $E$ and $F$, we examine ring homomorphisms, ring *-homomorphisms, algebra homomorphisms,…
We consider two inclusions of $C^*$-algebras whose small $C^*$-algebras have approximate units of the large $C^*$-algebras and their two spaces of all bounded bimodule linear maps. We suppose that the two inclusions of $C^*$-algebras are…
Given two graphs G and H its 1-{\it join} is the graph obtained by taking the disjoint union of G and H and adding all the edges between a nonempty subset of vertices of G and a nonempty subset of vertices of H. In general, composition…
This note constructs an explicit normal boundary dilation for a commuting pair $(S,P)$ of bounded operators with the symmetrized bidisk $$\Gamma=\{(z_1+z_2,z_1z_2):|z_1|,|z_2| \leq 1\}$$ as a spectral set. Such explicit dilations had…
The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. The lexicographic product of…
A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…