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

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Standard

Existence of Quantum Symmetries for Graphs on Up to Seven Vertices : A Computer based Approach. / Levandovskyy, Viktor; Eder, Christian; Steenpass, Andreas; Schmidt, Simon; Schanz, Julien; Weber, Moritz.

ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. ACM Association for Computing Machinery, 2022. s. 311-318.

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Harvard

Levandovskyy, V, Eder, C, Steenpass, A, Schmidt, S, Schanz, J & Weber, M 2022, Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach. i ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. ACM Association for Computing Machinery, s. 311-318, 2022 International Symposium on Symbolic and Algebraic Computation - ISSAC '22, Villeneuve-d'Ascq, Frankrig, 04/07/2022. https://doi.org/10.1145/3476446.3535481

APA

Levandovskyy, V., Eder, C., Steenpass, A., Schmidt, S., Schanz, J., & Weber, M. (2022). Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach. I ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation (s. 311-318). ACM Association for Computing Machinery. https://doi.org/10.1145/3476446.3535481

Vancouver

Levandovskyy V, Eder C, Steenpass A, Schmidt S, Schanz J, Weber M. Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach. I ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. ACM Association for Computing Machinery. 2022. s. 311-318 https://doi.org/10.1145/3476446.3535481

Author

Levandovskyy, Viktor ; Eder, Christian ; Steenpass, Andreas ; Schmidt, Simon ; Schanz, Julien ; Weber, Moritz. / Existence of Quantum Symmetries for Graphs on Up to Seven Vertices : A Computer based Approach. ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. ACM Association for Computing Machinery, 2022. s. 311-318

Bibtex

@inproceedings{9cd549dae8974b8bba0a9d035ef3f85f,
title = "Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach",
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 associative algebra associated to the quantum automorphism group is commutative. We use noncommutative Gr{\"o}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.",
author = "Viktor Levandovskyy and Christian Eder and Andreas Steenpass and Simon Schmidt and Julien Schanz and Moritz Weber",
year = "2022",
doi = "10.1145/3476446.3535481",
language = "English",
pages = "311--318",
booktitle = "ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation",
publisher = "ACM Association for Computing Machinery",
note = "2022 International Symposium on Symbolic and Algebraic Computation - ISSAC '22 ; Conference date: 04-07-2022 Through 07-07-2022",

}

RIS

TY - GEN

T1 - Existence of Quantum Symmetries for Graphs on Up to Seven Vertices

T2 - 2022 International Symposium on Symbolic and Algebraic Computation - ISSAC '22

AU - Levandovskyy, Viktor

AU - Eder, Christian

AU - Steenpass, Andreas

AU - Schmidt, Simon

AU - Schanz, Julien

AU - Weber, Moritz

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

U2 - 10.1145/3476446.3535481

DO - 10.1145/3476446.3535481

M3 - Article in proceedings

SP - 311

EP - 318

BT - ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation

PB - ACM Association for Computing Machinery

Y2 - 4 July 2022 through 7 July 2022

ER -

ID: 312696088