Homogeneous quantum groups and their easiness level
Abstract
Given a closed subgroup G⊂ UN+ which is homogeneous, in the sense that we have SN⊂ G⊂ UN+, the corresponding Tannakian category C must satisfy span(NC2)⊂ C⊂ span(P). Based on this observation, we construct a certain integer p∈ N\∞\, that we call "easiness level" of G. The value p=1 corresponds to the case where G is easy, and we explore here, with some theory and examples, the case p>1. As a main application, we show that SN⊂ SN+ and other liberation inclusions, known to be maximal in the easy setting, remain maximal at the easiness level p=2 as well.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.