Free Inhomogeneous Wreath Product of Compact Quantum Groups
Abstract: We introduce the free inhomogeneous wreath product of compact matrix quantum groups, which generalizes the free wreath product (Bichon 2004). We use this to present a general technique to determine quantum automorphism groups of connected graphs in terms of their maximal biconnected subgraphs, provided that we have sufficient information about their quantum automorphism groups. We show that this requirement is met for forests, outerplanar graphs, and block graphs leading to algorithms to compute the quantum automorphism groups of these graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.