38 citations · 135 across the 25 of their papers we have counts for
9 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…
Almost all trees have quantum symmetry
Luca Junk, Simon Schmidt, Moritz Weber
From the work of Erdős and Rényi from 1963 it is known that almost all graphs have no symmetry. In 2017, Lupini, Mančinska and Roberson proved a quantum counterpart: Almost all gra…
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…
New products and -extensions of compact matrix quantum groups
Daniel Gromada, Moritz Weber
There are two very natural products of compact matrix quantum groups: the tensor product and the free product . We define a number of further products interpolatin…
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…
Generating linear categories of partitions
Daniel Gromada, Moritz Weber
We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm which we used to obtain firs…
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…