Related papers: The Petersen graph has no quantum symmetry
We define quantum automorphisms and isomorphisms of Hadamard matrices. We show that every Hadamard matrix of size $N\ge 4$ has quantum symmetries and that all Hadamard matrices of a fixed size are mutually quantum isomorphic. These results…
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…
We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…
A finite simple graph $\Gamma$ is called a Nest graph if it is regular of valency $6$ and admits an automorphism $\rho$ with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. We say…
The automorphism group of a curve is studied from the viewpoint of the canonical embedding and Petri's theorem. A criterion for identifying the automorphism group as an algebraic subgroup the general linear group is given. Furthermore the…
Suppose that $G$ is a simple, vertex-labeled graph and that $S$ is a multiset. Then if there exists a one-to-one mapping between the elements of $S$ and the vertices of $G$, such that edges in $G$ exist if and only if the absolute…
We construct explicity the automorphism group of the folded hypercube $FQ_n$ of dimension $n>3$, as a semidirect product of $N$ by $M$, where $N$ is isomorphic to the Abelian group $Z_2^n$, and $M$ is isomorphic to $Sym(n+1)$, the symmetric…
We prove that after an arbitrarily small adjustment of edge lengths, the spectrum of a compact quantum graph with $\delta$-type vertex conditions can be simple. We also show that the eigenfunctions, with the exception of those living…
Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…
We discuss a PT-symmetric Hamiltonian with complex eigenvalues. It is based on the dimensionless Schr\"{o}dinger equation for a particle in a square box with the PT-symmetric potential $V(x,y)=iaxy$. Perturbation theory clearly shows that…
A classical theorem of Frucht states that any finite group appears as the automorphism group of a finite graph. In the quantum setting the problem is to understand the structure of the compact quantum groups which can appear as quantum…
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
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 investigate the combinatorial and geometric properties of automorphism groups of universal right-angled Coxeter groups, which are the automorphism groups of free products of copies of Z_2. It is currently an open question as to whether…
A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…
The BNSR-invariants of a group $G$ are a sequence $\Sigma^1(G)\supseteq \Sigma^2(G) \supseteq \cdots$ of geometric invariants that reveal important information about finiteness properties of certain subgroups of $G$. We consider the…
We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.