相关论文: A quantum Frucht's theorem and quantum automorphis…

Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

We introduce a category $\mathsf{qGph}$ of quantum graphs, whose definition is motivated entirely from noncommutative geometry. For all quantum graphs $G$ and $H$ in $\mathsf{qGph}$, we then construct a quantum graph $[G,H]$ of…

Let $U^-_q = U^-_q(\mathfrak g)$ be the negative part of the quantum group associated to a finite dimensional simple Lie algebra $\mathfrak g$, and $\sigma : \mathfrak g \to \mathfrak g$ be the automorphism obtained from the diagram…

Suppose that $M$ is a closed, connected, and oriented Riemannian $n$-manifold, $f \colon \mathbb{R}^n \to M$ is a quasiregular map automorphic under a discrete group $\Gamma$ of Euclidean isometries, and $f$ has finite multiplicity in a…

Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…

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…

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…

Witte Morris showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. The infinite dihedral group is defined as the free product with amalgamation $\mathbb Z_2 \ast \mathbb Z_2$. We…

We consider circulant graphs having $p$ vertices, with $p$ prime. To any such graph we associate a certain number $k$, that we call type of the graph. We prove that for $p>>k$ the graph has no quantum symmetry, in the sense that the quantum…

Let $\mathbb{G}$ be the quantum automorphism group of a finite dimensional C*-algebra $(B,\psi)$ and $\Gamma$ a discrete group. We want to compute the fusion rules of $\widehat{\Gamma}\wr_* \mathbb{G}$. First of all, we will revise the…

Given an associative $\mathbb{C}$-algebra $A$, we call $A$ strongly rigid if for any pair of finite subgroups of its automorphism groups $G, H,$ such that $A^G\cong A^H$, then $G$ and $H$ must be isomorphic. In this paper we show that a…

We introduce the notion of nonlocal symmetry of a graph $G$, defined as a winning quantum correlation for the $G$-automorphism game that cannot be produced classically. Recent connections between quantum group theory and quantum information…

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…

We define quantum automorphism groups of a wide range of discrete structures. The central tool for their construction is a generalisation of the Tannaka-Krein reconstruction theorem. For any direct sum of matrix algebras $M$, and any…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

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…

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…

Quantum symmetry of graph $C^{*}$-algebras has been studied, under the consideration of different formulations, in the past few years. It is already known that the compact quantum group $(\underbrace{C(S^{1})*C(S^{1})*\cdots…