Related papers: Quantum Sabidussi's Theorem
We show that the automorphism group of a graph product of finite groups $Aut(G_\Gamma)$ has Kazhdan's property (T) if and only if $\Gamma$ is a complete graph.
We introduce a quantum automorphism group for hypergraphs, which turns out to generalize the quantum automorphism group of Bichon for classical graphs. Further, we show that our quantum automorphism group acts on hypergraph C*-algebras as…
We study the automorphisms of a graph product of finitely-generated abelian groups W. More precisely, we study a natural subgroup Aut* W of Aut W, with Aut* W = Aut W whenever vertex groups are finite and in a number of other cases. We…
Anantharaman and Le Masson proved that any family of eigenbases of the adjacency operators of a family of graphs is quantum ergodic (a form of delocalization) assuming the graphs satisfy conditions of expansion and high girth. In this…
It has long been known that a vertex-transitive graph $\Gamma$ is isomorphic to a double coset graph $\text{Cos}(G,H,S)$ of a transitive group $G\le\text{Aut}(\Gamma)$, a vertex stabilizer $H\le G$, and some subset $S\subseteq G$. We show…
J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…
A notion of a quantum automorphism group of a finite quantum group, generalising that of a classical automorphism group of a finite group, is proposed and a corresponding existence result proved.
Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…
In 1869, Jordan proved that the set $\mathcal{T}$ of all finite group that can be represented as the automorphism group of a tree is containing the trivial group and it is closed under taken direct product of groups of lower order in…
We prove a number of results to the effect that generic quantum graphs (defined via operator systems as in the work of Duan-Severini-Winter / Weaver) have few symmetries: for a Zariski-dense open set of tuples $(X_1,\cdots,X_d)$ of…
We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…
By a construction of Vaughan Jones, the bipartite graph $\Gamma(A)$ associated with the natural inclusion of $\mathbb C$ inside a finite-dimensional $C^*$-algebra $A$ gives rise to a planar algebra $\mathcal P^{\Gamma(A)}$. We prove that…
We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…
We construct for every connected locally finite graph $\Pi$ the quantum automorphism group $\text{QAut}\ \Pi$ as a locally compact quantum group. When $\Pi$ is vertex transitive, we associate to $\Pi$ a new unitary tensor category…
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…
We provide elementary proofs of the Nielsen-Schreier Theorem and the Kurosh Subgroup Theorem via wreath products. Our proofs are diagrammatic in nature and work simultaneously in the abstract and profinite categories. A new proof that open…
The partial automorphisms of a graph $X$ having $N$ vertices are the bijections $\sigma:I\to J$ with $I,J\subset\{1,\ldots,N\}$ which leave invariant the edges. These bijections form a semigroup $\widetilde{G}(X)$, which contains the…
We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…
A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…