Related papers: A Frucht's theorem for quantum graphs

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…

I present a method of quantization using cohomology groups extended via coefficient groups of different types. This is possible according to the Universal Coefficient Theorem (UCT). I also show that by using this method new features of…

The characteristic map for the symmetric group is an isomorphism relating the representation theory of the symmetric group to symmetric functions. An analogous isomorphism is constructed for the symmetric space of symplectic forms over a…

An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…

Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…

Given a symmetry group acting on a principal fibre bundle, symmetric states of the quantum theory of a diffeomorphism invariant theory of connections on this fibre bundle are defined. These symmetric states, equipped with a scalar product…

A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…

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…

We show that if a field k contains sufficiently many elements(for instance, if k is infinite), and K is an algebraically closed field containing k, then every linear algebraic k-group over K is k-isomorphic to Aut(A\otimes_kK), where A is a…

For a strongly connected directed graph $\Lambda$, it is shown that the quantum automorphism group of $\Lambda$ acts isometrically in the sense of D. Goswami et al. on the spectral triple $(C^{\ast}(\Lambda), L^{2}(\Lambda^{\infty},M),D)$…

We discuss generalizations of the notion of i) the group of unitary elements of a (real or complex) finite dimensional C*-algebra, ii) gauge transformations and iii) (real) automorphisms, in the framework of compact quantum group theory and…

The (universal) $\imath$quantum groups are as a vast generalization of (Drinfeld double) quantum groups. We establish an algebra homomorphism from universal $\imath$quantum group of split type to a certain quantum torus, which can be viewed…

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…

We introduce the notion of a generalized flow on a graph with coefficients in a R-representation and show that the module of flows is isomorphic to the first derived functor of the colimit. We generalize Kirchhoff's laws and build an exact…

A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…

We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…

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…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

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…

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…