Algorithmic problems in categories of partitions
From MaRDI portal
Cites work
- A Concrete Model for the Quantum Permutation Group on 4 Points
- A problem of A. I. Mal'tsev
- An invitation to quantum groups and duality. From Hopf algebras to multiplicative unitaries and beyond
- Classification results for easy quantum groups
- Compact Matrix Quantum Groups and Their Combinatorics
- Easy quantum groups and quantum subgroups of a semi-direct product quantum group
- Existence of quantum symmetries for graphs on up to seven vertices. A computer based approach
- scientific article; zbMATH DE number 3779604 (Why is no real title available?)
- Introduction to compact (matrix) quantum groups and Banica-Speicher (easy) quantum groups
- Liberation of orthogonal Lie groups
- Mathematics of Quantum Computation and Quantum Technology
- Non-hyperoctahedral categories of two-colored partitions. I: New categories
- Non-hyperoctahedral categories of two-colored partitions. II: All possible parameter values
- On algebras which are connected with the semisimple continuous groups
- On the classification of easy quantum groups
- Quantum automorphisms of matroids
- Quantum groups based on spatial partitions
- Quantum symmetry groups of finite spaces
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Tannaka-Krein duality for compact matrix pseudogroups. Twisted SU(N) groups
- The classification of tensor categories of two-colored noncrossing partitions
- The full classification of orthogonal easy quantum groups
- Unitary easy quantum groups: the free case and the group case
- Worst-case Analysis of Set Union Algorithms
This page was built for publication: Algorithmic problems in categories of partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288966)