16:00
An Adian-Rabin Theorem for Quantum Automorphism Groups of Graphs
Abstract
When we look at a graph, one of the first questions that might naturally come to mind is "Does this graph have any symmetry?" In fancier language, is the automorphism group trivial? The quantum automorphism group is a compact matrix quantum group which is meant to capture the quantum symmetries of the graph. Although we've ramped up the jargon, we still have the same question: Given a graph, does it have any quantum symmetries? In this talk, I'll explain why this question is undecidable, thanks to an Adian-Rabin theorem for quantum automorphism groups. Consequently, there are graphs where the quantum automorphism group is non-trivial but has no non-trivial finite-dimensional representations (or in other words, the discrete quantum automorphism group is trivial).
Joint work with Josse van Dobben de Bruyn.