Unitary Easy Quantum Groups: the free case and the group case
Pierre Tarrago, Moritz Weber

TL;DR
This paper introduces and classifies unitary easy quantum groups using colored partitions, extending the combinatorial framework to include the free and group cases, and explores their construction and properties.
Contribution
It defines unitary easy quantum groups with colored partitions, classifies free cases combinatorially, and introduces new quantum group products for their construction.
Findings
Ten series of free unitary easy quantum groups classified
Construction of quantum groups via generalized free complexification
Introduction of new products between quantum groups
Abstract
Easy quantum groups have been studied intensively since the time they were introduced by Banica and Speicher in 2009. They arise as a subclass of (-algebraic) compact matrix quantum groups in the sense of Woronowicz. Due to some Tannaka-Krein type result, they are completely determined by the combinatorics of categories of (set theoretical) partitions. So far, only orthogonal easy quantum groups have been considered in order to understand quantum subgroups of the free orthogonal quantum group . We now give a definition of unitary easy quantum groups using colored partitions to tackle the problem of finding quantum subgroups of . In the free case (i.e. restricting to noncrossing partitions), the corresponding categories of partitions have recently been classified by the authors by purely combinatorial means. There are ten series showing up each indexed by one or two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
