Some Results on Bichon's Quantum Automorphism Group of Graphs
Abstract
The notion of the quantum automorphism group of a graph was introduced by J. Bichon in 2003 and T. Banica in 2005 respectively. This article explores primarily the quantum automorphism group of a graph , denoted by QAutBic(), in Bichon's framework. First, we provide a sufficient condition for non-commutativity of Bichon's quantum automorphism group and discuss several applications of this criterion. Although it is known that QAutBic() QAutBic(c) does not hold in general, we identify a family of graphs for which this isomorphism enforces that the graph has no quantum symmetry. Moreover, we describe a few families of graphs having quantum symmetries whose quantum automorphism groups in Bichon's sense are commutative. Finally, we show that free product, tensor product and free wreath product constructions can arise as Bichon's quantum automorphism groups of connected graphs in the following sense: For a finite family of compact matrix quantum groups \Qi\i=1m arising as Bichon's quantum automorphism groups of certain graphs, there exist connected graphs free, ten and wr whose quantum automorphism groups are *i=1m Qi, i=1m Qi and Q1 * Q2 respectively.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.