Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Documents

  • Fulltext

    Submitted manuscript, 1.02 MB, PDF document

  • Viktor Levandovskyy
  • Christian Eder
  • Andreas Steenpass
  • Schmidt, Simon
  • Julien Schanz
  • Moritz Weber
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In general, there are more quantum symmetries than symmetries and it is a non-trivial task to determine when this is the case for a given graph: The question is whether or not the associative algebra associated to the quantum automorphism group is commutative. We use noncommutative Gröbner bases in order to tackle this problem; the implementation uses Gap and Singular:Letterplace. We determine the existence of quantum symmetries for all connected, undirected graphs without multiple edges and without self-edges, for up to seven vertices. As an outcome, we infer within our regime that a classical automorphism group of order one or two is an obstruction for the existence of quantum symmetries.
Original languageEnglish
Title of host publicationISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation
PublisherACM Association for Computing Machinery
Publication date2022
Pages311-318
DOIs
Publication statusPublished - 2022
Event2022 International Symposium on Symbolic and Algebraic Computation - ISSAC '22 - Villeneuve-d'Ascq, France
Duration: 4 Jul 20227 Jul 2022

Conference

Conference2022 International Symposium on Symbolic and Algebraic Computation - ISSAC '22
LandFrance
ByVilleneuve-d'Ascq
Periode04/07/202207/07/2022

ID: 312696088