vix.ing · top · new · best · stats · spec

Existence of quantum symmetries for graphs on up to seven vertices: a computer based approach

2019/06/28 by Eder, Christian, Levandovskyy, Viktor, Schanz, Julien +3 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics #Quantum Algebra (math.QA)

paper · doi:10.48550/arxiv.1906.12097

Abstract

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 algebra associated to the quantum automorphism group is commutative. We use Gröbner base computations in order to tackle this problem; the implementation uses GAP and the SINGULAR package 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.

Cited by

Related