Related papers: Asymmetric graphs with quantum symmetry
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
We define and study quantum permutations of infinite sets. This leads to discrete quantum groups which can be viewed as infinite variants of the quantum permutation groups introduced by Wang. More precisely, the resulting quantum groups…
Motivated by non-local games and quantum coloring problems, we introduce a graph homomorphism game between quantum graphs and classical graphs. This game is naturally cast as a "quantum-classical game"--that is, a non-local game of two…
In a recent paper of Bhowmick, Skalski and So{\l}tan the notion of a quantum group of automorphisms of a finite quantum group was introduced and, for a given finite quantum group G, existence of the universal quantum group acting on G by…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
The Fibonacci cube $\Gamma_n$ is is the graph whose vertices are independent subsets of the path graph of length $n$, where two such vertices are considered adjacent if they differ by the addition or removal of a single element. Klav\v{z}ar…
Motivated by string diagrammatic approach to undirected tracial quantum graphs by Musto, Reutter, Verdon (2018), in the former part of this paper we diagrammatically formulate directed nontracial quantum graphs by Brannan, Chirvasitu,…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
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…
For a finite group $G$, denote by $\alpha(G)$ the minimum number of vertices of any graph $\Gamma$ having $\text{Aut}(\Gamma)\cong G$. In this paper, we prove that $\alpha(G)\leq |G|$, with specified exceptions. The exceptions include four…
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…
The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…
Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…
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 give a characterisation of quantum automorphism groups of trees. In particular, for every tree, we show how to iteratively construct its quantum automorphism group using free products and free wreath products. This can be considered a…
Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
The quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was hoped that similar approach may be useful to solve the other…