相关论文: Quantum Symmetries of Graph C*-algebras Having Max…
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…
Quantum spheres are among the most studied examples of compact quantum spaces, described by C*-algebras which are Cuntz-Krieger algebras of a directed graph, as proved by Hong and Szyma\'nski in 2002. About five years earlier, in 1997, Sheu…
A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…
Let $A$ be a group acting by automorphisms on the group $G.$ \textit{The commuting graph $\Gamma(G,A)$ of $A$-orbits} of this action is the simple graph with vertex set $\{x^{A} : 1\ne x \in G \}$, the set of all $A$-orbits on $G\setminus…
Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…
A semigroupoid is a set equipped with a partially defined associative operation. Given a semigroupoid \Lambda we construct a C*-algebra C*(\Lambda) from it. We then present two main examples of semigroupoids, namely the Markov semigroupoid…
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…
The construction of the C*-algebra associated to a directed graph $E$ is extended to incorporate a family $C$ consisting of partitions of the sets of edges emanating from the vertices of $E$. These C*-algebras $C^*(E,C)$ are analyzed in…
The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…
We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…
Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…
Suppose $D$ is a finite dimensional C*-algebra carrying a continuous action $\overline{\Pi}$ of the circle group $\mathbb{T}$. We study the quantum symmetry group of $D$, taking $\overline{\Pi}$ into account. We show that they are braided…
We study a canonical C$^*$-algebra, $\mathcal{S}(\Gamma, \mu)$, that arises from a weighted graph $(\Gamma, \mu)$, specific cases of which were previously studied in the context of planar algebras. We discuss necessary and sufficient…
We introduce a family of $C^*$-correspondences $X_\alpha$ naturally associated to every ordinal graph $\Lambda$. When $\Lambda$ is a directed graph, $X_0$ is isomorphic to the usual $C^*$-correspondence associated to a graph. We show that…
We prove that, if $\Gamma$ is a finite connected $3$-valent vertex-transitive, or $4$-valent vertex- and edge-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of…
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…
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…
A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to…
We show that for $q\in (0,1),$ the $C^{*}$-algebra $SU_{q}(3)$ is isomorphic a rank $2$ graph $C^{*}$-algebra (in the sense of Pask and Kumjian). This graph is derived by passing the to the limit $q\to 0$ for a set of generators of…
We consider the boundary-path groupoids of topological higher-rank graphs. We show that the all such groupoids are topologically amenable. We deduce that the C*-algebras of topological higher-rank graphs are nuclear and prove versions of…