Quantum automorphisms of folded cube graphs (Q2656651)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quantum automorphisms of folded cube graphs |
scientific article |
Statements
Quantum automorphisms of folded cube graphs (English)
0 references
16 March 2021
0 references
Associated to any finite graph \(X\), having \(N\) vertices, is the automorphism group \(G(X)\subset S_N\), as well as the quantum automorphism group \(G^+(X)\subset S_N^+\). When the inclusion \(G(X)\subset G^+(X)\) is not an isomorphism, the graph \(X\) is said to have quantum symmetry. The graphs having quantum symmetry are rare and interesting objects, and this is due to the fact that a random graph is known not to have quantum symmetry. Examples, which are however often disconnected, can be constructed by using various product operations. Some other classes of known examples are not vertex-transitive. From this perspective, constructing ``beautiful'' graphs \(X\) which do have quantum symmetry, and this for ``beautiful'' reasons, is a very interesting question. The paper under review falls into this class. The author proves that the folded \(N\)-cube graph has quantum symmetry group \(SO_N^{-1}\), and in particular that the Clebsch graph has quantum symmetry group \(SO_5^{-1}\). These are fundamental results, adding to the list of known similar results (``quantum symmetry due to new reasons''), which is very short. The proofs are by direct algebraic computation. Let us also mention that here \(SO_N^{-1}\) is by definition a \(q=-1\) twist in the semisimple, compact quantum group sense, obtained by replacing the commutation between the standard coordinates of \(O_N\) by a mixed commutation/anticommutation, and when adding a condition of type ``the twisted determinant must be~\(1\)''.
0 references
finite graphs
0 references
graph automorphisms
0 references
automorphism groups
0 references
quantum automorphisms
0 references
quantum groups
0 references
quantum symmetries
0 references
0 references
0 references