12 citations · 27 across the 6 of their papers we have counts for
6 papers · 1 filter
Uniformly vertex-transitive graphs
Simon Schmidt, Chase Vogeli, Moritz Weber
We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a…
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…
Non-Hyperoctahedral Categories of Two-Colored Partitions, Part I: New Categories
Alexander Mang, Moritz Weber
Compact quantum groups can be studied by investigating their co-representation categories in analogy to the Schur-Weyl/Tannaka-Krein approach. For the special class of (unitary) "e…
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…
Models of quantum permutations
Stefan Jung, Moritz Weber
For we present a series of *-homomorphisms where is the quantum permutation group. They are not necessarily representations of the qu…
Categories of Two-Colored Pair Partitions, Part II: Categories Indexed by Semigroups
Alexander Mang, Moritz Weber
Within the framework of unitary easy quantum groups, we study an analogue of Brauer's Schur-Weyl approach to the representation theory of the orthogonal group. We consider concrete…