Solution group representations as quantum symmetries of graphs
arXiv:2111.12362 · doi:10.1112/jlms.12664
Abstract
In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that the quantum automorphism group of such a colored graph is the dual of the homogeneous solution group of the underlying linear constraint system. Given a vertex- and edge-colored graph with certain properties, we construct an uncolored graph that has the same quantum automorphism group as the colored graph we started with. Using those results, we obtain the first known example of a graph that has quantum symmetry and finite quantum automorphism group. Furthermore, we construct a pair of quantum isomorphic, non-isomorphic graphs that both have no quantum symmetry.
References in corpus (8)
- Quantum Symmetry Groups of Finite Spaces
- Notes on Compact Quantum Groups
- Perfect Commuting-Operator Strategies for Linear System Games
- Algebras, Synchronous Games and Chromatic Numbers of Graphs
- On the quantum symmetry of distance-transitive graphs
- Synchronous linear constraint system games
- The Frucht property in the quantum group setting
- On C*-Algebras Generated by Isometries with Twisted Commutation Relations