12 citations · 27 across the 6 of their papers we have counts for
4 papers · 1 filter
Sinkhorn algorithm for quantum permutation groups
Ion Nechita, Simon Schmidt, Moritz Weber
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogona…
Existence of quantum symmetries for graphs on up to seven vertices: a computer based approach
Christian Eder, Viktor Levandovskyy, Julien Schanz +3
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 b…
Intertwiner spaces of quantum group subrepresentations
Daniel Gromada, Moritz Weber
We consider compact matrix quantum groups whose -dimensional fundamental representation decomposes into an -dimensional and a one-dimensional subrepresentation. Even if w…
Quantum groups with partial commutation relations
Roland Speicher, Moritz Weber
We define new noncommutative spheres with partial commutation relations for the coordinates. We investigate the quantum groups acting maximally on them, which yields new quantum ve…