2000 character limit reached
Super-easy quantum groups: definition and examples
Published 1 Jun 2017 in math.QA | (1706.00152v1)
Abstract: We investigate the "two-parameter" quantum symmetry groups that we previously constructed with Skalski, with the conclusion that some of these quantum groups, namely those without singletons, are "super-easy" in a suitable sense, that we axiomatize here. Our formalism covers as well the symplectic group $Sp_n$ and its free version $Sp_n+$, and some other interesting examples. Finally, we address the general problem of classifying the super-easy quantum groups, and we make a few comments on it.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.