Group-theoretical graph categories

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum–Weber, 2015) and skew categories of partitions (more general; due to Maaßen, 2018). We generalize these results to the case of graph categories, which allows to replace the symmetric group by the group of automorphisms of some graph.


Introduction
The main subject of this article is diagrammatic categories that can be used to model representation categories of groups and quantum groups. One typical example is the category of all partitions P, which models the intertwiner spaces of the symmetric group [4]. Another classical example is so-called Brauer duality, which connects the category of all pairings with the orthogonal group. Some additional categories of partitions (i.e. subcategories of the category of all partitions) were later interpreted in The author was supported by the collaborative research centre SFB-TRR 195 "Symbolic Tools in Mathematics and their Application". I would like to thank Alexander Mang, David Roberson, and Moritz Weber for inspiring discussions about graph categories. I also thank to Laura Maaßen for discussing details of her work and the relations with this article. I am grateful to Moritz Weber also for reading and commenting an early draft of this manuscript. Many thanks go to the referee for a detailed review that significantly improved the quality of the article. Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
B Daniel Gromada gromada@math.uni-sb.de 1 Fachbereich Mathematik, Saarland University, Postfach 151150, 66041 Saarbrücken, Germany the theory of quantum groups [2]. A recent paper [8] studies categories of graphs. In particular, the category of all graphs can be used to model the representation category of the automorphism group Aut G of a given graph G.
These results can all be understood as some generalizations of the classical Schur-Weyl duality. But we can also go the opposite direction. Starting with a certain category, we can reconstruct the unique compact matrix quantum group associated with this category using the so-called Tannaka-Krein reconstruction (for quantum groups formulated by Woronowicz [15]). This idea motivated the search for classification of all categories of partitions as every such instance defines a new compact matrix quantum group.
This classification was successfully completed in [11]. An important large class of the categories of partitions is formed by so-called group-theoretical categories [9,10]. Those categories are shown to be in one-to-one correspondence with sS ∞ -invariant normal subgroups A Z * ∞ 2 . In addition, it is shown that the associated quantum group is of the formˆ S n , where = Z * n 2 /A. The semidirect product constructionˆ S n makes sense also if A is S ∞ -invariant, but not sS ∞ -invariant. In that case, the standard categories of partitions cannot be used to describe the intertwiners. A natural question is then, whether there is an alternative approach to model the representation categories. This was solved in [7] by introducing skew categories of partitions.
The goal of the current article is to generalize those concepts defined for categories of partitions into the more general context of categories of graphs. The article is divided into two parts-the first part dealing with combinatorics and the second part dealing with the quantum groups and intertwiners. Each part consists of a preliminary section (Sects. 1 and 3 ) and sections with original results (Sects. 2,4,5).
In Sect. 1, we introduce categories of partitions and graphs and recall the important combinatorial results from [9] and [7]. In Sect. 2, we generalize those results into the graph-categorical context. We define group-theoretical graph categories to be those graph categories that are invariant under taking graph quotients. We also introduce more general skew graph categories. We show that such categories can be described in a group-theoretical manner in terms of graph fibrations.
Theorem A (Theorem 2.13) There is a one-to-one correspondence between graph fibrations F and skew graph categories C described by Formulae (2.1), (2.2). The graph fibration F is easy if and only if the skew graph category C is a group-theoretical graph category.
In Sect. 3, we introduce compact matrix quantum groups and their connections with categories of partitions and graphs. In particular, we recall the important results from [7,10]. In Sect. 4, we generalize those results into the graph-categorical context. First, we look at the easy case. In Theorem 4.1, we show that group-theoretical graph categories correspond to quantum groups of the formˆ Aut G. Then, we focus on the more general case of skew graph categories and obtain the following result.
Theorem B (Theorem 4.18) Let F be a graph fibration and C the corresponding category. Let G be a graph and let K be the greatest subgraph of G contained in F. Then, the quantum group corresponding to C G is Finally, in Sect. 5, we discuss the opposite question: Given a quantum group of the form G =ˆ Aut G, what graph category can we associate with it and what are the corresponding intertwiner spaces. In Theorem 5.11, we even generalize Theorem and describe the intertwiner spaces for the semidirect productˆ H , where H ⊆ S n is an arbitrary permutation group and is an H -invariant quotient of Z * n 2 .

Partitions
Let S be a set. A partition π of S is a decomposition of the set S into disjoint nonempty subsets. That is, π = {V 1 , . . . , V n } with V i = ∅, V i ∩ V j = ∅, and i V i = S. We denote π ∈ P(S).
Another way to represent partitions is to use words. Let V be some countable alphabet. We denote by V * the monoid of words over V . By V k , we denote all words of length k. We denote by ∅ ∈ V 0 the empty word. We may represent partitions of k points as words in V k by identifying the blocks of p with some letters in V . Note that this representation is not unique as we may always choose a different identification between letters and blocks. Given a word a ∈ V k , we denote by ker(a) the associated partition. For example, the above partition p can be represented by the following words p = = ker(aabacbdd) = ker(ccecgeaa).
Consider k, l ∈ N 0 . We denote by P(k, l) the set of partitions of k upper and l lower points, that is, partitions of the set {1, . . . , k} {1, . . . , l}. Those will again be represented pictorially. This time, we put k points in one line and l on another line below and connect again those points that share the same part. In order to make clear, whether crossing strings denote a single block or two separate ones, we denote the blocks by dots. That is, all strings coming from points belonging to a single block intersect in a single point emphasized by a dot. For example, The partitions on two lines can also be represented by pairs of words. The first word represents the top line, and the second word represents the bottom line.
For partitions on two lines P ∈ P(k, l), it will also be convenient to allow having empty blocks. That is, in the diagrams, there may also occur isolated dots.

Categories of partitions
We define the following operations on the sets P(k, l) • The tensor product of two partitions P ∈ P(k, l) and Q ∈ P(k , l ) is the partition P ⊗ Q ∈ P(k + k , l + l ) obtained by writing the graphical representations of P and Q "side by side".

⊗ =
• For P ∈ P(k, l), Q ∈ P(l, m), we define their composition QP ∈ P(k, m) by putting the graphical representation of Q below P identifying the lower row of P with the upper row of Q. The upper row of P now represents the upper row of the composition, and the lower row of Q represents the lower row of the composition.
• For P ∈ P(k, l), we define its involution P * ∈ P(l, k) by reversing its graphical representation with respect to the horizontal axis. * = .
Those operations define the structure of a rigid monoidal involutive category on the collection P(k, l). The set of natural numbers forms the set of objects, and the partitions P ∈ P(k, l) are the morphisms k → l.
Any collection of subsets C (k, l) ⊆ P(k, l) containing the identity partition ∈ C (1, 1) and the pair partition ∈ C (0, 2) (playing the role of the duality morphism) that is closed under the category operations and under adding and removing empty blocks is again a category called a category of partitions.
This definition comes from [2]. We made a slight modification here by allowing partitions to have empty blocks. (In [2], the empty blocks that arise in composition are simply deleted.) But since we require the categories to be closed under adding and removing empty blocks, the definitions are equivalent.

Group-theoretical categories of partitions
A category of partitions C is called group-theoretical if ∈ C . This definition was introduced in [9]. The name comes from a certain correspondence formulated below.
Let V be a countable set. We denote by Z * V 2 the free product Z * |V | 2 , where the generators of the factors are identified with the elements of V . For a given word a ∈ V * , we denote by g a ∈ Z * V 2 the corresponding group element.
bijections V → V that act as identity up to a finite amount of points). It is called sS V -invariant if it is invariant with respect to arbitrary finitary maps V → V , i.e. arbitrary maps V → V that act as identity up to a finite amount of points.
Given a word a ∈ V * , we denote by a * ∈ V * its reflection, i.e. the word read backwards. Note that g a * = g −1 a .
forms a group-theoretical category of partitions.
Conversely, let C be a group-theoretical category of partitions. Then, As an example of an sS V -invariant normal subgroup, we mention the infinite family where the double angle brackets denote the smallest normal subgroup generated by the given generators. For more instances, see [9, Example 3.9].

Skew categories of partitions
The definition of a category of partitions was modified in [7] in order to generalize the above-described correspondence to all S V -invariant normal subgroups A Z * V 2 . We define the following operations that are essentially based on the group multiplication in Z * V 2 Considering P = ker(a, b) and Q = ker(c, d), we call the partition ker(ac, bd) a connected tensor product of P and Q. Note that the result does not only depend on the partitions P and Q, but also on the labelling of the blocks. For given P and Q, we can always choose the corresponding labellings a, b, c, d in such a way that the words a and b do not share any letters with c and d. In that case, we obtain the standard tensor product as defined in Sect. 1.2. In general, the connected tensor product enables to unite some blocks from P with some blocks from Q by choosing a common letter to denote those blocks.
We define the restricted composition to be the ordinary composition from Sect. 1.2, but we restrict only to the pairs of partitions of the form P = ker(a, b), Q = ker(b, c). Note that we can choose the words a and c in such a way that they share only the letters contained in b. In that case, the result of such composition can be written as QP = ker(a, c). In general, we can define the restricted connected composition to be the operation (ker(a, b), ker(b, c)) → ker(a, c).
A skew category of partitions is a collection of sets C (k, l) ⊆ P(k, l) containing the identity partition and the pair partition that is closed under all possible connected tensor products (with all possible choices of the labelling), restricted compositions, involution, and adding/removing empty blocks. It automatically follows that C is closed under restricted connected compositions.
Skew categories of partitions are again rigid monoidal involutive categories, but this time the set of objects is formed by one-line partitions k∈N 0 P(k). For a pair of partitions p ∈ P(k), q ∈ P(l), we define the set of morphisms Note that any group-theoretical category of partitions is closed under joining blocks [9,Lemma 2.3]. Consequently, it is closed under connected tensor products and hence forms a skew category of partitions. On the other hand, skew categories of partitions always contain the partition . Moreover, group-theoretical categories of partitions precisely correspond to those skew categories of partitions that are invariant with respect to joining blocks.
We have the following generalization of Theorem 1.
forms a skew category of partitions.
Conversely, let C be a skew category of partitions. Then,

Graph categories
The goal of this work is to generalize the above results to so-called graph categories defined in [8].
In this article, by a graph, we will always mean a finite undirected graph with no multiple edges, but with possibility of having loops.
A bilabelled graph K is a triple (K , a, b), where K is a graph, a = (a 1 , . . . , a k ), b = (b 1 , . . . , b l ) are tuples of vertices of K . We will call a the tuple of input vertices, while b are output vertices. (The role of a and b is switched in comparison with [8] to be consistent with the notation for partitions.) For any k, l ∈ N 0 , we denote by G (k, l) the set of all bilabelled graphs K = (K , a, b) with |a| = k, |b| = l (considering the graphs "up to isomorphism"). The set of all bilabelled graphs is denoted simply by G .
We define a structure of a (monoidal involutive) category on the set of all bilabelled graphs by introducing some operations. Consider K = (K , a, b), H = (H , c, d). We define a graph that is created from H K by contracting the vertex b i with c i for every i (ignoring the resulting edge multiplicities), We denote by N k the edgeless graph with k vertices. In particular, N 0 is the null graph containing no vertex. We denote 0 : Any collection of bilabelled graphs C containing M 1,1 (playing the role of identity), M 0,2 (playing the role of the duality morphism), 0 (playing the role of the scalar identity) and closed under the above-defined operations forms a rigid monoidal involutive category called a graph category.
We can represent the bilabelled graphs pictorially in a similar way as partitions. Unlike [8], we will draw them "top to bottom" instead of "right to left" to be consistent with partitions.
Considering K = (K , a, b) ∈ G (k, l), we put k points on a line and l points on another line below. Between those two lines of points, we draw the graph K and each input vertex a i is connected by a string to the ith point on the top line and each output vertex b j is connected by a string to the jth point on the bottom line. The graph edges are drawn by thick lines, whereas the above-mentioned connecting strings are drawn thin. Typical examples of a bilabelled graphs may look as follows: The categorical operations then have a similar pictorial interpretation as in the case of partitions. Tensor product is putting "side by side": Composition is putting one graph below the other and contracting the strings: Involution is vertical reflection. * = .
In this spirit, the category of partitions embed into the category of all graphs. Given P ∈ P(k, l), we associate with it an edgeless bilabelled graph, where the vertices stand for the blocks of P. That is, P → (N b , a, b), where b is the number of blocks in P and P = ker(a, b). In particular, note that the bilabelled graphs M k,l containing a single vertex correspond to partitions consisting of a single block (e.g. M 1,1 = , M 0,2 = ). For the rest of this article, we will not distinguish between partitions with k upper and l lower points and the associated bilabelled graphs.

Remark 1.3
Formally, there is no bijection between categories of partitions and categories of edgeless graphs. The reason is that in case of partitions, we assume by definition that the categories are closed with respect to adding and removing empty blocks. In the language of graphs, empty blocks correspond to isolated vertices. Any graph category is certainly closed under adding isolated vertices as the graph with a single isolated vertex is contained in any category (since = · ), but it need not be closed under removing those vertices. In case of graph categories, this can be considered as an unimportant technical detail. However, it becomes important in case of skew categories of partitions and skew graph categories, which we are going to define later.

Rotations and Frobenius reciprocity
Consider a bilabelled graph K = (K , (a 1 , . . . , a k ), (b 1 , . . . , b l )) ∈ G (k, l). We define its It holds that every category of graphs (and hence also every category of partitions) is closed under both those operations and their inverses. The proof is simple: Those rotations can actually be realized by composing with some tensor product of the pair partition and identities. For example, we can express As a consequence, any category of graphs C is generated by the collection of graphs with output vertices only K ∈ C (0, k), k ∈ N 0 .

Group-theoretical graph categories
In this section, we generalize the group-theoretical categories of partitions and skew categories of partitions from [7,9]

Graph quotients and overlapping unions
First, we define some important operations on graphs.
Definition 2.1 Let K be a graph and π a partition of its vertex set V (K ). We denote by K /π the quotient graph, where the set of vertices are the blocks of π and there is an edge between two blocks if there is an edge in K between some of their elements. We denote by q π the surjection V (K ) → V (K /π ), which actually defines a graph homomorphism q π : K → K /π . Definition 2.2 Consider two graphs K and H . An injective partial function f : there is at most one pair in f containing v will be called a vertex overlap of K and H . We denote by K ∪ f H the quotient of K H , where we identify all the pairs in f . We call it the f -union of K and H .
If f is empty, then K ∪ f H = K H is the disjoint union. Considering nonempty f corresponds to the situation where the vertex sets V (K ) and V (H ) overlap and then we compute the true union of K and H . We denote by f K the inclusion

Graph fibrations
Before introducing group-theoretical categories of partitions, we first define the structure providing the group-theoretical description, which we call the graph fibration. Let us start with introducing some notation.

Notation 2.3
Let V , V be some sets and consider a map ϕ : V → V . Then, the obvious homomorphisms V * → V * and Z * V 2 → Z * V 2 induced by ϕ are denoted by the same letter ϕ. In particular, the same applies if ϕ is a graph homomorphism (K , a), where K is a graph (equivalence class up to isomorphism) and a ∈ Z , such that (N 0 , e), (N 1 , e) ∈ F (e denotes the group identity) and the following holds.

Definition 2.4 A graph fibration F is a set of ordered pairs
(F3) For any pair of graphs K and H and any vertex overlap f , If F(K ) is non-empty, we write K ∈ F and call F(K ) a fibre of F. A graph fibration is called easy if it is closed under quotients. That is: (F4) For any K ∈ F and any partition π of V (K ), we have q π (F(K )) ⊆ F(K /π ).

Remark 2.5
Let us clarify what do we exactly mean by "up to isomorphism" here. The elements of F are formally equivalence classes of the pairs (K , a) with respect to the following equivalence: Nevertheless, in the following text we will not strictly distinguish between the elements and the equivalence classes. In particular, given a graph K , we denote by such that the equivalence class of (K , a) is an element of F (exactly as we wrote in (F1)). So, F(K ) should always be seen as a normal subgroup of Z * V (K ) 2 containing the actual elements of Z * V (K ) 2 , not any kind of equivalence classes. This then of course already implies that F(K ) is invariant with respect to the automorphisms of K , so the axiom (F2) is in some sense redundant. Nevertheless, it is convenient to have it explicitly listed since, if we are practically working with the actual graph and not their equivalence classes, we then have to explicitly check that every F(K ) is indeed Aut K -invariant.

Remark 2.6
In case of easy graph fibrations, the axiom (F3) can be equivalently formulated just for disjoint unions since any f -union is a quotient of the disjoint union.

Notation 2.7
In the following text, we will usually suppress the maps f K and f H . That is, for a pair of graphs K and H and a vertex overlap f , we identify K and H with the corresponding subgraphs of K ∪ f H . If it is clear, which vertex overlap f are we using, this should cause no confusion.

Group-theoretical graph categories
In this section, we define what is a group-theoretical graph category. The motivation for such a definition and name is (similarly as in case of partitions) that we have a certain group-theoretical description of such categories-namely the easy graph fibrations defined in the previous section. The structure of group-theoretical graph categories is then generalized by defining skew graph categories, which then correspond to general graph fibrations.

Definition 2.8
A group-theoretical graph category is a graph category C ⊆ G , which is closed under taking graph quotients.

Remark 2.9
In terms of partitions, taking quotients means simply joining different blocks. The ability to join blocks is also the key feature of group-theoretical categories of partitions. That is, a category of partitions C contains (so C is group-theoretical) if and only if it is closed under joining blocks [9, Lemma 2.3].
That is, there is a correspondence between group-theoretical categories of partitions and group-theoretical graph categories containing edgeless graphs only. In contrast to Remark 1.3, this correspondence is bijective. Indeed, since group-theoretical graph categories are supposed to be closed under quotients, they must in particular be closed under removing isolated vertices.
There is no such a simple characterization for group-theoretical graph categories as we do for categories of partitions. For instance, it does not hold that any graph category containing the partition would be group-theoretical. Nevertheless, in Sect. 2.6, we are going to formulate a similar characterization in terms of generators.
In the following, we are going to define skew categories of graphs as a generalization of skew categories of partitions.
Considering partitions p ∈ P(k), q ∈ P(l), denote We can restrict the composition of bilabelled graphs K = (K , a, b), H = (H , c, d) only to the cases, when ker b = ker c and then interpret the collection of sets G ( p, q) as a monoidal * -category with one-line partitions k∈N 0 P(k) as the set of objects. Definition 2.10 A skew graph category C is a set C ⊆ G of bilabelled graphs containing 0 ∈ C (0, 0), ∈ C (1, 1) and ∈ C (0, 2), which is closed under

Remark 2.11
Skew graph categories are indeed rigid monoidal * -categories. In particular, the following holds.
(a) For every partition p ∈ P(k), we have an identity morphism id p ∈ C ( p, p) ⊆ C (k, k) that can be created as an appropriate f -union of the identities ∈ C (1, 1). Finally, we connect skew graph categories with their group-theoretical description.

Theorem 2.13
There is the following one-to-one correspondence between graph fibrations and skew graph categories. For any graph fibration F, we define a graph category Conversely, we associate with any skew graph category C a graph fibration The graph fibration F is easy if and only if the skew graph category C is a grouptheoretical graph category.
Proof Take a graph fibration F and construct C as in (2.1). The equality in (2.1) follows from F(K ) being normal. Now, we prove that C is a skew graph category, that is, closed under the skew category operations. Unions: Take K = (K , a, b) and H = (H , c, d) from C and a vertex overlap f .
Involution follows from F(K ) being closed under the group inversion, so if . Now, let us assume that F is easy, i.e. invariant with respect to quotients and let us prove that C is closed under all compositions. So, take arbitrary F. Now, we can take the quotient of K H by identifying the vertices b i with c i for every i. This then exactly corresponds to the composition HK. Finally, since F is closed under quotients, C is also closed under quotients.
The converse direction is very straightforward. Consider a skew graph category C and prove that (2.2) defines a graph fibration. First of all, note that the equalities in (2.2) follow from skew graph categories being closed under rotations. Now, consider some . First, we prove that F(K ) is closed with respect to multiplication. Take a, b such that (K , ∅, a), (K , ∅, b) ∈ C , so g a , g b ∈ F(K ). Then, we must have (K , ∅, a) ∪ id (K , ∅, b) = (K , ∅, ab), so g a g b ∈ F(K ). Secondly, we prove that F(K ) is closed on taking inverses. Considering K = (K , ∅, a) ∈ C , we have K * = (K , a, ∅) ∈ C , so g −1 a ∈ F(K ). Finally, the normality. Taking again K = (K , ∅, a) ∈ C and v ∈ V (K ), then we can construct , av), where f is the vertex overlap identifying the vertex of with v. This graph then corresponds to g −1 v g a g v . Proving that F is closed under f -unions and, assuming that C is a group-theoretical graph category, proving that F is closed under taking quotients, is similarly straightforward.
Finally, we prove that those assignments C → F and F → C are inverse to each other, which means that the correspondence is indeed one-to-one. Denote by the map (K , a, The correspondence can then be formulated as an assignment C → F := (C ) and F → C := −1 (F). Note that is a well-defined mapping, but it is not injective. So, it remains to prove that −1 ( (C )) = C . In other words, we have to prove that, for every skew category of graphs, K : The equality means that K can differ from K by rotation-but this is fine as C is closed under rotations-and by adding or removing some pair vv, where v ∈ V (K ), to the input/output sequence. Adding of such a pair can be achieved by computing an f -union with (or or ), removing can be achieved by contraction, i.e. composing with ⊗· · · ⊗ ⊗ ⊗· · ·⊗ (some additional rotations may be needed).
Remark 2.14 (On loops in graphs) Often, people are interested in simple graphs, that is, graphs without loops. So, there might be a question: Is it essential to consider graphs with loops in the definition of a graph category and graph fibration or can one do the same also without loops?
The easiest way is to actually consider graphs with a loop at every vertex. Everything works perfectly fine if we implicitly assume that every graph appearing in this article has a loop at every vertex. Some statements can even be formulated in a simpler way under this assumption. We will comment on this at the particular places later on in this article. Note, however, that this assumption also means that we are slightly modifying the definition of graph categories and graph fibrations since now N 1 -the graph, which is by assumption contained in every graph fibration and every graph category-denotes the graph with a single vertex and a loop. Now, what if we want to restrict to truly simple graphs only, i.e. graphs that have literally no loops. Simple bilabelled graphs are closed under all the operations of skew graph categories. So, in case of skew graph categories, we can again just restrict to simple graphs. However, simple graphs are not closed under taking quotients. So, in case we want to work with ordinary graph categories or, equivalently, easy graph fibrations, then we actually have to construct a quotient category rather than a subcategory. If a graph operation on simple graphs yields a non-simple graph, then just declare the result to be equal to zero.
Note that in the easy case, the distinction between the loops-everywhere and noloops-at-all approaches may not be entirely cosmetic. As we just mentioned, the category operations will act differently. Also the notion of a graph homomorphism differs in those two situations. On the other hand, in the non-easy situation, we deal only with injective homomorphisms, where this distinction disappears.

Full fibrations
Proof We have K = K ∪ ι H , so the lemma follows from axiom (F3).

Proposition 2.17 (Alternative definition of full graph fibrations) A full graph fibration F is equivalently a collection of normal subgroups F(K )
for all graphs K , which is closed under injective homomorphisms. That is, for every injective homomorphism of two graphs ι : H → K , we have ι(F(H )) ⊆ F(K ).
Proof The left-right implication follows from Lemma 2.16. For the right-left implication, we get axiom (F2) by choosing ϕ to be the graph automorphism. To check (F3), take any pair of fibres K , H ∈ F and their vertex overlap f . Since F contains all graphs as fibres, it must contain also K ∪ f H . Choosing ι := f K in our assumption, we directly have that F(K ) embed into F(K ∪ f H ) by f K and the same holds for H . Proof For the left-right implication, we just decompose the homomorphism as ϕ = ι • q, where q is a surjective homomorphism (that is, a quotient) and ι is injective (that is, an embedding). Now we just use axiom (F4) to deal with q and Lemma 2.16 to deal with ι.
Most of the right-left multiplication is proven in 2.17, and we just have to handle the easiness, i.e. axiom (F4). This follows by taking ϕ = q π . So, if we are computing with the implicit assumption that every graph has a loop at every vertex (see Remark 2.14), then a graph fibration is always full unless it contains edgeless graphs only.
Proof If there is any H ∈ B containing at least one edge, then we can construct a graph with two vertices connected by an edge as its quotient. Possibly missing loops at those two vertices can be added using some f -union with itself and then performing a quotient. From the full graph on two vertices (with loops everywhere), any graph K (with loops everywhere) can be constructed using f -unions.

Example 2.20 (Group-theoretical categories of partitions) Consider
Let C A be the associated category of partitions. Denote by V n := {a 1 , . . . , a n } the first n letters in V and by A n := A ∩ Z * V n 2 the corresponding subgroup of A using only those letters a 1 , . . . , a n . Then, we can define an easy graph fibration where N n is the edgeless graph with n vertices identified with the letters a 1 , . . . , a n . The associated graph category can then be identified with the category of partitions C A .
Conversely, as we mention in Remark 2.9, a group-theoretical graph category C where all graphs have no edges can always be identified with a group-theoretical category of partitions. Such a category then corresponds to some graph fibration F with fibres A k := F(N k ). Axiom (F3) in this case means that the groups A k are closed under injective homomorphisms A k → A l , k ≤ l mapping generators to generators, so we have a chain of embeddings · · · A k ⊆ A k+1 ⊆ · · · . Axiom (F4) means that the groups are closed also under the surjective homomorphisms A l → A k , k ≤ l mapping generators to generators, so, in particular, each group is just a subgroup of the union A := k A k generated by {a 1 , . . . , a k }.

Example 2.21 (Skew categories of partitions) Let
A be an S V -invariant normal subgroup of Z * V 2 . Then, the above-mentioned construction defines a (possibly non-easy) graph fibration F A . The associated skew graph category then coincides with the skew category of partitions corresponding to A. Example 2.22 ("New" skew categories of partitions) In this case, the converse does not hold. A skew graph category C containing edgeless graphs only may not be closed under removing isolated vertices, in which case we cannot identify it with a skew category of partitions in the sense of [7]. Let us look what happens on the level of the group-theoretical description. Let F be the corresponding graph fibration with fibres A k := F(N k ). Again, axiom (F3) means that we have a chain of embeddings · · · A k ⊆ A k+1 ⊆ · · · . But now we are missing axiom (F4) which would allow us to project from right to left. So, F may not be determined by a single group A Z * V 2 . Let us bring a concrete example suggested to the author by Laura Maaßen: Consider the skew graph category C generated by . That is, A 3 is the normal subgroup of Z * 3 2 generated by a 1 a 2 a 3 and its permutations; moreover, A k for any k ≥ 3 is the normal subgroup of Z * k 2 generated by a i a j a k with i, j, k ∈ {1, . . . , k} mutually distinct. For k < 3 is A k trivial. We can again try to take A := k A k , but this no more determines all the sets A k . Indeed, we have a 1 a 2 = (a 1 a 3 a 4 ) · (a 4 a 3 a 2 ) ∈ A 4 ⊆ A, but obviously a 1 a 2 / ∈ A 2 ! (And one can actually also prove that a 1 a 2 / ∈ A 3 .) We can look on this example in terms of pictures. Starting with the generator , we can do the connected tensor product with itself to obtain . Now, a composition with gives us . So, in the end, Modifying the definition of a skew graph category, namely by removing the assumption that the category is closed under removing empty blocks, we can "repair" the correspondence. Using this modified definition, it will again hold that skew categories of partitions exactly correspond to the skew graph categories containing edgeless graphs only. It depends on the application whether it is more convenient to use the former simpler definition, where a skew category is determined by a single group A Z * V 2 , or whether one needs the more general definition with a sequence of groups. Note that the latter may be necessary to describe certain quantum group semidirect productsˆ S n , see Remark 5.2.

Example 2.23 (Homogeneous graph fibration) Let
A be an S V -invariant normal subgroup of Z * V 2 and let B be a set of graphs closed under arbitrary f -unions. For every graph K ∈ B, consider some injection ι K : Since A is S V -invariant, it does not matter, how precisely we define the injection ι K . Then, we can define a graph fibration F A,B by The associated graph category can be described as follows:

Example 2.24 (Easy full homogeneous graph fibration) Let
A be sS V -invariant normal subgroup of Z * V 2 . Then, we can construct an easy full graph fibration F A,full := F A,B taking B to be the set of all graphs. So, F A,full (K ) = A K for every graph K .
In the following example, we construct an easy full graph fibration that is not determined by a single normal subgroup A Z * V 2 . Example 2.25 (There is more!) For every graph K , we define F(K ) to be the normal subgroup of Z * V (K ) 2 generated by words of the form abab, where a, b are any adjacent vertices in K , so Here, by the double brackets, we denote the normal subgroup generated by the given generators. Now since adjacency is preserved under f -unions and quotients, we have that F is indeed closed under those operations and hence it is an easy graph fibration.

Generators of categories
In this section, we study group-theoretical graph categories and skew graph categories in terms of generators. We answer the following two questions. Firstly, given a set of generators, find an explicit description of the group-theoretical category or the skew category it generates. Secondly, we characterize group-theoretical categories among all graph categories in terms of their generators.

Definition 2.26
Let S be a set of bilabelled graphs. We denote by S , resp., S grp-th , resp., S skew the graph category, resp., group-theoretical graph category, resp., skew graph category generated by S. That is, the smallest category containing S.

Definition 2.27
Let S be a set of graphs. We define its closure under arbitrary funions to be the smallest set of graphs containing S and closed under f -unions.
In this article, we will typically consider generating sets S that contain the onevertex graph N 1 as this is required by the definition of a graph fibration. (We should formally also always include the empty graph N 0 , but this has of course virtually no impact on the closure under f -unions.)

Example 2.28
Take the graph of two adjacent vertices K 2 = . Then, the closure of {N 1 , K 2 } is simply the set of all graphs (as was already used in the proof of Proposition 2.19).
Take now the triangle K 3 = . The closure of {N 1 , K 3 } is the set of all graphs, where every edge is incident to some triangle. (Indeed, take such a graph G and denote by n the number of its vertices. We can reconstruct G as follows. By repeated unions of N 1 , construct the edgeless graph N n . Now, go through every edge in G and use the f -union to add the whole triangle this edge is incident with to our graph we are constructing (it does not matter which one if there is more). This way, we add all the necessary edges. For the converse direction, it is easy to see that the described set is indeed closed under f -unions.) In the following propositions, the double angle brackets again denote the normal subgroup generated by the given generators.

Proposition 2.29
Let S be a set of bilabelled graphs. Denote by C the skew graph category generated by S and by F the corresponding graph fibration. Then, F contains as fibres the closure of N 0 , N 1 , and the underlying graphs in S under arbitrary funions. For every K ∈ F, we then have Proof The fact that F contains as fibres (at least) the f -union closure of graphs in S follows from axiom (F3) of graph fibrations being closed under f -unions. Now the ⊇ inclusion in the equality follows from Lemma 2.16. To prove the inclusion ⊆, it is enough to show that the right-hand side defines a graph fibration. By definition, F(K ) is a normal subgroup so (F1) holds. If we take an embedding ι : H → K , then ϕ • ι is surely also an embedding for any ϕ ∈ Aut K , so (F2) holds. Finally, taking two fibres K , K ∈ F and their vertex overlap f , then K ∪ f K is again a fibre by definition. Any element of F(K ) is of the form a = ι(g a * b ). Since f K • ι is surely an injective homomorphism, we have that f K The situation in the easy case, i.e. with group-theoretical graph categories, gets a bit simpler if we are focusing only on graphs with a loop at every vertex (see Remark 2.14). Recall from Proposition 2.19 that in this case a group-theoretical graph category either coincides with some group-theoretical category of partitions or it corresponds to a full graph fibration. H , a, b)

Proposition 2.30 Let S be a set of bilabelled graphs containing at least one graph with at least one edge. Denote by C the group-theoretical graph category generated by S and by F the corresponding full easy graph fibration. Then,
for every graph K with loops at every vertex.
Proof Follows directly from Propositions 2.18 and 2.19. Now, we look on the question of generators of group-theoretical graph categories. First, we need a small lemma.

Lemma 2.31 Let C be a graph category containing
. Then, C is closed under the following operations.
(1) Moving a pair of neighbouring output strings coming from a common vertex: (2) Computing quotients K → K/π , where all vertices of K that are not input/output are singletons in π (i.e. they are not identified with any other vertex).
Proof Moving the pair of strings one position left, resp., right is achieved by composing with … … , resp., … … . Identifying two distinct output vertices is achieved by composing with partition … … … … , which is generated by (see [9, page 6]).

Proposition 2.32 Let S be a set of bilabelled graphs such that every vertex appears at least once within the input/output vertices. Then, the graph category , S is group-theoretical. Consequently,
, S = S grp-th .
Proof Given any bilabelled graph K = (K , a, b), we associate with it a bilabelled graphK := (K , a, bv), where v = v 1 v 1 v 2 v 2 · · · v m v m and {v 1 , . . . , v m } denotes the set of all vertices in K . It holds that for any K ∈ S, we haveK ∈ , S . Indeed, recall that for every v ∈ V (K ), we assume that it is an input/output vertex. We can create two extra input/output strings coming from the vertex by composing with = · ( ⊗ ). Then, we can move those to the end of the output tuple by Lemma 2.31(1). Now, we prove that actually for any K ∈ , S , we haveK ∈ , S . It is enough to show that for every K, H ∈ , S , such thatK,H ∈ , S , we also have K ⊗ H, H · K, K * ∈ , S . This is straightforward to check using Lemma 2.31(1).
Finally, it follows from Lemma 2.31(2) that , S is closed under arbitrary graph quotients. Indeed, taking any K ∈ , S , we can constructK, then use Lemma 2.31 (2) to construct the corresponding quotient, and finally delete the redundant output strings by composing with .
We can also reformulate the above proposition as an equivalence.

Proposition 2.33 Let C be a graph category. It is group-theoretical if and only if there exists a set of bilabelled graphs S whose vertices all appear in the input/output tuples such that C = , S .
Proof The right-left implication follows directly from Proposition 2.32. To prove the left-right implication, take any generating setS of C . Computing f -unions of graphs inS with , we are able to make all vertices of the graphs appear in the input/output tuples while not changing the category they generate. Finally, we already mentioned in Remark 2.12 that every group-theoretical graph-category must contain as an f -union of , , and .

Example 2.34
As an example, consider the category , . From Proposition 2.32, it follows that it is a group-theoretical graph category-the smallest one containing the bilabelled graph . Now using Proposition 2.30, we find out that this category is described by the graph fibration from Example 2.25.

Preliminaries: quantum groups and Tannaka-Krein duality
In this section, we introduce very briefly the theory of compact matrix quantum groups, Tannaka-Krein duality, and the connection with diagram categories. For more detailed introduction, see, for example, [3,13].

Compact matrix quantum groups
An orthogonal compact matrix quantum group is a pair G = (A, u), where A is a * -algebra and u ∈ M n (A) a matrix such that (1) the elements u i j i, j = 1, . . . , n generate A, (2) the matrix u is orthogonal, i.e. u i j = u * i j and uu t = 1 n = u t u, (3) the map : A → A ⊗ min A defined as (u i j ) := n k=1 u ik ⊗ u k j extends to a * -homomorphism.
This formulation comes from [3]. We could consider more general compact matrix quantum groups by weakening axiom (2) (instead of orthogonality assuming only that u and u t are unitarizable). This concept was first introduced by Woronowicz in [14]. Compact matrix quantum groups generalize the notion of compact matrix groups in the following sense.  H = (A, v), where A is a commutative * -algebra, is of this form.
For this reason, given any compact matrix quantum group G = (A, u), we denote O(G) := A (interpreting the elements as non-commutative functions). The matrix u is called the fundamental representation of G. However, there is also a dual viewpoint coming from the following example. Example 3.2 (Finitely generated group ) Let be a finitely generated discrete group. Denote by g 1 , . . . , g n its generators. Let C be the associated group * -algebra, denote by γ 1 , . . . , γ n ∈ C its elements corresponding to the generators of and by γ the diagonal matrix γ = diag(γ 1 , . . . , γ n ). Then,ˆ = (C , γ ) is also a compact matrix quantum group. If g 2 i = e, i.e. γ 2 i = 1, then it is an orthogonal CMQG. It is called the compact dual of .
We say that a compact matrix quantum group H = (O(H) That is, quantum subgroup can be constructed by adding relations to the algebra.
In this article, we focus on compact matrix quantum groups of the following form.

Example 3.3 (Semidirect productˆ H ) Let H ⊆ S n be a permutation group represented by permutation matrices. That is, H can be considered as a compact matrix quantum group
Let be a finitely generated group with generators g 1 , . . . , g n and let us define the matrix γ = diag(γ 1 , . . . , γ n ) ∈ M n (C ), where γ i correspond to g i , sô = (C , γ ) is a compact matrix quantum group as discussed above. It holds that G :=ˆ H := (C ⊗ O(H ), γ v) is a compact matrix quantum group. In particular, if we assume that g 2 i = e, i.e. g −1 i = g i , so γ 2 i = 1 and γ * i = γ i , then G is an orthogonal compact matrix quantum group.
To see that, denote u := γ v, i.e. u i j = γ i v i j . The orthogonality is obvious since both γ and v are orthogonal matrices. Consequently, axiom (2) holds. We have that γ i = k u ik and v i j = u 2 i j , so the axiom (1) holds. Finally, axiom (3) can be proven by showing that the comultiplication corresponds to a semidirect product construction with respect to the (co)action of H ⊆ S n on by permuting the generators. See [10,Sect. 2.5] for details (also see, e.g. [6,Sect. 10.2.6] for the definition of the double crossed product). In order to emphasize this structure, we will denote this quantum group byˆ H := G.

Representation categories and Tannaka-Krein duality
In this paper, by a representation category, we mean a linear rigid monoidal * -category, where the monoid of objects is the natural numbers N 0 and morphisms are realized as linear operators. To be more concrete: Consider n ∈ N. A representation category is a collection of vector spaces such that the following holds: (1) For T ∈ C(k, l), T ∈ C(k , l ), we have T ⊗ T ∈ C(k + k , l + l ).
(4) For every k ∈ N 0 , we have 1 ⊗k n ∈ C(k, k). (5) We have n k=1 e k ⊗ e k ∈ C(0, 2). Given a compact matrix quantum group G with fundamental representation u of size n × n, we define It is easily checked that C G is a representation category in the sense of our definition. The so-called Tannaka-Krein duality says also the converse:

CMQGs associated with diagram categories
Let us fix a graph G and label its vertices by numbers 1, . . . , n := |V (G)|. For every bilabelled graph K = (K , a, b) ∈ G (k, l), we define a linear map T G K : (C n ) ⊗k → (C n ) ⊗l by the following formula Consequently, for any graph category C ⊆ G , its image under T G , i.e. the collection forms a representation category. We can apply Woronowicz-Tannaka-Krein theorem to this category and associate a compact matrix quantum group to it.
We can actually construct the quantum group very explicitly. The associated *algebra can be defined as the universal * -algebra satisfying the intertwiner relations u ⊗k T = T u ⊗l : Actually, thanks to the Frobenius reciprocity, we may only consider the bilabelled graphs with output vertices only: Those ideas formulated in [8] constitute a generalization of the work [2], which used categories of partitions to construct quantum groups. Recall that the category of all partitions embed into the category of all graphs. Let G be a graph and n := |V (G)|. Consider a partition P ∈ P(k, l), which can also be interpreted as an edgeless bilabelled graph P ∈ G (k, l). Then, regardless of the structure of G, we have T G P = T  j). That is, assign the k points in the upper row of p the numbers i 1 , . . . , i k (from left to right) and the l points in the lower row j 1 , . . . , j l (again from left to right). Then, δ P (i, j) = 1 if the points belonging to the same block are assigned the same numbers. Otherwise δ P (i, j) = 0.
To bring an example, recall the partitions p and q from Equation 1.1. (4,4).
In this case, we have Example 3.7 (Important graph categories and the associated quantum groups) In this paper, we will use the following two important results: Let G be a graph with n vertices. The category of all partitions P corresponds to the group of all permutations S n represented by permutation matrices [2,4]. That is, considering n ∈ N, denote by A σ the permutation matrix corresponding to a permutation σ ∈ S n . Then, The category of all graphs G corresponds to the group of all automorphisms Aut G of the given graph G [8]. That is, intertwiners of Aut G are given by

CMQGs associated with group-theoretical categories of partitions
The quantum groups corresponding to group-theoretical categories of partitions were identified in [10]: the associated normal subgroup and by A n Z * n 2 its subgroup using only n generators (as in Example 2.20). Denote := Z * n 2 /A n . Then, the quantum group associated with C is of the form In that case, the quantum group G :=ˆ S n does not correspond to any category of partitions. But can we describe the associated intertwiner spaces in a different way? This question is answered in [7], where skew categories of partitions were introduced for this purpose.
Let P ∈ P(k, l) be a partition and n ∈ N. We definê This defines a linear mapT (n) P : (C n ) ⊗k → (C n ) ⊗l by [T (n) P ] ji :=δ P (i, j). The assignment P →T (n) P is not a functor! Despite this, the following holds.

The easy case
Let G be a graph. In the following theorem, we characterize the compact matrix quantum group associated through the functor T G to a group-theoretical graph category C corresponding to some graph fibration F assuming that G ∈ F. Recall from Proposition 2.19 that, if G has a loop at every vertex, then G ∈ F is satisfied automatically unless F contains edgeless graphs only (which would mean that C is a category of partitions and this case is already handled by Theorem 3.8).

Theorem 4.1 Let G be a graph, F an easy graph fibration with G ∈ F. Denote by C the group-theoretical graph category associated with F and by G the quantum group associated with C and G. Then,
Proof To make sense of the statement and the proof, we need to identify the vertices of G with numbers 1, . . . , n := |V (G)|. Let us denote by u the fundamental representation of G. We have ∈ C and hence G ⊆ Z * n 2 S n . Therefore, we can write u = γ v, where γ = diag(γ 1 , . . . , γ n ) with γ 1 , . . . , γ n corresponding to the generators of Z * n 2 and v i j corresponding to the generators of S n . So, γ k commute with v i j , the v i j are even central projections, and we can express v i j = v 2 i j = u 2 i j and Before going into the proof, let us denote by ξ a := T G (G,∅,a) the intertwiner associated with the bilabelled graph (G, ∅, a) for some given word a. Recall that the entries of this vector are given by First, we are going to prove the inclusion ⊆. We need to show that the generators γ i satisfy the relations of and that the generators v i j satisfy the relations of Aut G. Let us start with the latter. Denote G := (G, ∅, v) andG := (G, ∅,ṽ), where v = (1, 2, . . . , n) andṽ = (1, 1, 2, 2, . . . , n, n). Since gṽ = e and since G ∈ F, we surely haveG ∈ C (0, 2n). We can writeG = ⊗n · G, so the relation associated withG ∈ C (0, 2n) can be written as One can easily check that T (u ⊗ u)T = v since u 2 i j = v i j . So, multiplying the relation above with T ⊗n from left, we get exactly v ⊗n ξ v = ξ v . Substituting v by some permutation matrix A σ corresponding to a permutation σ ∈ S n , we need to show that the relation implies that σ ∈ Aut G. In terms of the entries, the relation then reads Note that ξ v i equals either one or zero depending on whether j → i j defines a homomorphism G → G. Hence, if we choose i : = (1, 2, . . . , n), the relation exactly says that σ should be an automorphism G → G.
So, we have just proven that v represents some subgroup of Aut G. Consequently, its representation category contains all intertwiners associated with any bilabelled graph. In particular, v ⊗k ξ a = ξ a for any word a with g a ∈ F(G). (This can actually be proven also directly by modifying the proof above.) Now, we derive the relations for the generators γ i . We need to show that γ a = γ a 1 · · · γ a k equals identity for every word a such that g a ∈ F(G). So, take some word a such that g a ∈ F(G), for which we have the relation ξ a = u ⊗k ξ a = γ ⊗k v ⊗k ξ a = γ ⊗k ξ a , so If we choose i := a, we surely have ξ a a = 0, so we can divide by this number and get γ a 1 · · · γ a k = 1, which is what we wanted.
To prove the opposite inclusion, we need to take arbitrary K ∈ C (k, l) and show that the relationũ ⊗l T G K = T G Kũ ⊗k is satisfied inˆ Aut G. Here, we denote byũ the fundamental representation ofˆ Aut G. Let us denote alsoũ =γṽ, wherẽ γ is the fundamental representation ofˆ andṽ is the fundamental representation of Aut G. From Frobenius reciprocity, it is enough to consider bilabelled graphs K with output vertices only. For any such K = (K , ∅, a) ∈ C (0, k), denote by ξ a K the corresponding intertwiner. Since v is the fundamental representation of Aut G, we have againũ ⊗k ξ a K =γ ⊗k ξ a K . The relation [γ ⊗k ξ a K ] i = [ξ a K ] i can be written as So, we need to show that g i ∈ F(G) for all words i ∈ V (G) * such that there exist a graph K and a word a ∈ V (K ) * such that g a ∈ F(K ) and a graph homomorphism ϕ : K → G such that ϕ(a) = i. But this directly follows from Proposition 2.18.

Example 4.2
Recall the category , from Examples 2.25 and 2.34. Considering a graph G, this category corresponds to the semidirect productˆ Aut G, where is a group generated by some g v , v ∈ V (G) such that g 2 v = e for every v and g v g w = g w g v if there is an edge {v, w} ∈ E(G).
For example, consider G = . In this case, Aut where H 2 = Z 2 S 2 = (Z 2 × Z 2 ) S 2 is the hyperoctahedral group and * denotes the quantum group (dual) free product as defined by Wang [12].

TheT maps
In the following subsections, we are going to interpret the skew categories of graphs in terms of quantum groups. We start with generalizing the idea of the mapsT .

Remark 4.4
Considering some bilabelled graph K = (K , a, b), we haveT K = 0 unless K is a subgraph of G. In particular, we haveT K = 0 whenever V (K ) > V (G).

Proposition 4.5 Consider
Proof To prove item (1), we need to show for all multiindices i, j, i , j that For every (ϕ, ψ), we can define a vertex overlap f : and an injective homomorphism ω : K ∪ f H → G by gluing ϕ and ψ together. Conversely, taking a vertex overlap f and an injective homomorphism ω : K ∪ f H → G, we can define ϕ : K → G and ψ : H → G by ϕ(v) = ω(v) and ψ(w) = ω(w). We see that the assignment (ϕ, ψ) ↔ (ω, f ) is a bijection. From this, the equality follows.
We use the same approach to prove (2).

Remark 4.15
If F contains the single vertex graph N 1 , then the number of vertices in K coincides with the number of vertices in G. Indeed, if K had fewer vertices, then K N 1 would still be a subgraph of G contained in F.
that is, #{inj. hom. ϕ : K → G such that ϕ(a) = i} = #{inj. hom. ϕ : K → G such that σ (ϕ(a)) = i}. This is surely satisfied by every σ ∈ Aut K . For the converse inclusion G ⊆ Aut K , we need to take any σ ∈ S V (K ) satisfying the intertwiner relations of C G and show that actually σ ∈ Aut K . We do this by a smart choice for the intertwiner: we take v : = (v 1 , . . . , v n ), where v 1 , . . . , v n is the list of all the vertices in V .

Theorem 4.18
Let F be a graph fibration and C the corresponding category. Let G be a graph, and let K be the greatest subgraph of G contained in F. Then, the quantum group corresponding to C G is Proof Again, we need to fix the inclusion ι : K → G, so that we can identify the vertices of K with the vertices of G, i.e. V := {v 1 , . . . , v n } := V (K ) = V (G). The proof now closely follows the proof of Theorem 4.1. Denote by G the quantum group corresponding to C . Again, we must have G ⊆ Z * n 2 S n as ∈ C . So, denote u = γ v the fundamental representation of G.
To prove the inclusion G ⊆ˆ Aut K , we have to show that the generators γ i satisfy the relations of and that v i j satisfy the relations of Aut K . For the first part, the proof is completely the same as in case of Theorem 4.1.
For the second part, putṽ We surely have e = gṽ ∈ F(K ), soK := (K , ∅,ṽ) ∈ C (0, 2m). Denote also K : We can writeK = ⊗m · K, so the relation associated withK ∈ C (0, 2m) can be written as Recall that v i j = v 2 i j = u 2 i j and hence v = T (u ⊗ u)T . Thus, multiplying the above relation by T ⊗m from the right, we obtain v ⊗m ξ v = ξ v .
As we show in the proof of Proposition 4.17, this is exactly the defining relation for the group Aut K .
To show the opposite inclusion, denote byũ =γṽ the fundamental representation ofˆ Aut K . We need to show thatũ satisfies the relations corresponding to the intertwiners from C G . Thanks to Proposition 4.16, we know the linear bases of the morphism spaces and we do not have to consider every possible H ∈ C . So, we need to show thatũξ a = ξ a for every a ∈ V (K ) * such that g a ∈ F(K ), where ξ a =T G (K ,∅,a) . From Proposition 4.17, we know that ξ a is an intertwiner of Aut K , so we havẽ where k denotes the length of a. It remains to show thatγ ⊗k ξ a = ξ a . This relation, rewritten in the tensor entries, reads γ i 1 · · ·γ i k = 1 whenever ∃ϕ : K → G inj. hom. such that ϕ(a) = i.
According to Lemma 4.14, the embedding of K to G is determined uniquely up to automorphisms of K . So, we must have ϕ ∈ Aut K for the injective homomorphism above. So, we need to show thatγ ϕ(a 1 ) · · ·γ ϕ(a k ) = 1. Since F(K ) is supposed to be Aut K -invariant, we have ϕ(g a ) ∈ F(K ) and hence the mentioned relation is indeed satisfied in Z * V 2 /F(K ).

Associating categories to semidirect product CMQGs
In the previous text, we managed to determine the quantum groups associated with group-theoretical graph categories and skew categories. Namely, it turned out that the quantum group is always of the form G =ˆ Aut K . In this section, we would like to comment on the opposite direction: Given a quantum group of such a structure, what categories can we associate with it? What are the corresponding intertwiner spaces?

Graph category associated with quantum group
Proposition 5.1 Let G be a graph and let be some Aut G-invariant quotient of . Then, there exists a skew graph category C such that C G forms the representation category associated with the quantum group G =ˆ Aut G.
Proof Let A be the Aut G-invariant normal subgroup of Z * V (G) 2 such that = Z * V (G) 2 /A. We construct C to be the smallest skew category containing all the bilabelled graphs (G, ∅, a) with g a ∈ A.
Recall from Proposition 2.29 that we are able to explicitly construct the associated graph fibration F: The fibres of F are formed by the closure of the set {N 0 , N 1 , G} under arbitrary f -unions. Each fibre is then defined by F(H ) := {ι H (a) | a ∈ A; ι H : G → H inj. hom.}. In particular, we have F(G) = A, so = Z * V (G) 2 /F(G). Therefore, the quantum group corresponding to the above-defined category is indeed G =ˆ Aut G. Remark 5.2 By choosing G := N n the edgeless graph on n vertices, we get the following statement: Let A n be an S n -invariant normal subgroup of Z * n 2 . Denote := Z * n 2 /A n . Then, there exists a skew graph category C containing edgeless graphs only such that C G forms the representation category associated with the quantum groupˆ S n .
This statement does not hold for skew categories of partitions as they were defined in [7]. That is, although the category C from the statement above contains edgeless graphs only, it might not correspond to any skew category of partitions, because it might not be closed under removing isolated vertices (see Example 2.22). In the group language, there need not exist an S ∞ -invariant normal subgroup A Z * ∞ 2 such that A n is a subgroup of A generated by n of the canonical generators. Compare with [7,Theorem 4.20].

Remark 5.3
The above-mentioned proposition can be easily generalized replacing Aut G by Aut K , but K is not allowed arbitrary. It must hold that if F is the closure of {N 0 , N 1 , K } under arbitrary f -unions, then K must be the greatest subgraph of G contained in F. This condition can be equivalently formulated as follows: K is a subgraph of G with |V (K )| = |V (G)| and, for every ϕ ∈ Aut G, if ϕ(K ) is a subgraph of G (taking the same embedding), then ϕ ∈ Aut K .

Remark 5.4
The graph category corresponding to a given quantum group G = Aut G is not determined uniquely. For example, the group G = Aut G is known to be associated with the category of all graphs (which is also a special case of Theorems 4.1, 4.18). However, the construction described in the proof above would yield a different category: The fibres of the graph fibration would be determined as the completion of {N 0 , N 1 , G} under f -unions. Consequently, it would not be a full graph fibration and it would not correspond to the category of all graphs.
We could also modify the proof of Proposition 5.1 and construct a full graph fibration F corresponding to G =ˆ Aut G. Every graph H would form a fibre of F determined by exactly the same formula F(H ) = {ι H (a) | a ∈ A; ι H : G → H inj. hom.} and F(H ) = E trivial if H is not a subgraph of G. Such a collection would be obviously closed under injective graph homomorphisms, so it would indeed form a full graph fibration. Returning back to the example G = Aut G, this construction would lead to yet another graph category.
We can formulate an analogous statement also in the easy case. Let us denote by End G the monoid of graph homomorphisms G → G.

Proposition 5.5 Consider a graph G and let be some
. Then, there exists a group-theoretical graph category C such that C G forms the representation category associated with the quantum group G =ˆ Aut G. Since /F(G) and hence the above-defined graph fibration corresponds to the quantum group G = Aut G.
However, even in the easy case, the category is not determined uniquely. Take, for example, the graph G = of two connected vertices, so Aut G = S 2 and take = Z 2 × Z 2 . So we are looking for a group-theoretical graph category C such that C G corresponds to G :=ˆ Aut G = (Z 2 × Z 2 ) S 2 = H 2 -the hyperoctahedral group. The following three categories are mutually distinct, but all of them correspond to G: The first one is the category constructed in the proof of Proposition 5.5-the smallest full category. We have encountered it already in Examples 2.25, 2.34, and 4.2. The second one is the group-theoretical partition category corresponding toˆ S 2 . The last one is generated by the previous two.

Computing intertwiners
In this subsection, we look on the problem of associating the intertwiner spaces C G (k, l) = Mor(u ⊗k , u ⊗l ) = {T : (C n ) ⊗k → (C n ) ⊗l | T u ⊗k = u ⊗l T } to a given quantum group G = (O(G), u) of the form G =ˆ Aut G. First of all, let us mention what is, in our opinion, a serious disadvantage of graph categories in comparison with categories of partitions: The morphism spaces C (k, l) of a given graph category are typically infinite. This also means that the functor K → T G K is highly non-injective.
As a consequence, if we want to construct a representation category C G (k, l) := span{T G K | K ∈ C (k, l)} (interpreting it afterwards as a representation category C G of some quantum group G), then it might be highly non-trivial to explicitly compute what those spaces actually are (for some given k, l) since we are making a linear span over an infinite number of elements. In addition, in many applications, we need linear independence, that is, we really need to know a basis of the intertwiner spaces (see, e.g. [3,5]).
Fortunately, this issue was solved in case of group-theoretical and skew graph categories in Sect. 4.2: Considering the quantum group G =ˆ Aut G, we know that the basis of C G (k, l) is exactly the set {T ab G } [a,b]∈W G (k,l) (recall Prop. 4.13). In the following section, we formulate a generalization of such statement replacing the group Aut G with any permutation group.

Remark 5.6
This disadvantage of graph categories is in general unavoidable. In particular, it is not possible to give such a formula for the intertwiner spaces for the so-called quantum automorphism group of graphs (determined by the category of all planar bilabelled graphs) as this would solve the quantum isomorphism problem, which was proven to be undecidable [1].

Intertwiners corresponding to any permutation group
In this section, we generalize the results of Sect. 4 replacing the automorphism group Aut G or Aut K by any permutation group H ⊆ S n . However, in this case we do not have such a diagrammatic calculus (at least not such a simple one given by bilabelled graphs) since the representation category of H may not be generated by a single matrix A : C n → C n . Note that given a graph G, we haveT ab Aut G =T ab G =T G (G,a,b) . Moreover, we have the following. #{ϕ ∈ H | ϕ(a, b) = (i, j)}.
Assuming that ϕ(a, b) = (i, j), then obviously P = ker(a, b) if and only if P = ker(i, j). So, the above equals zero whenever P = ker(i, j). On the other hand, assume that P = ker(i, j). Choose two pairs (a 1 , b 1 ) and (a 2 , b 2 ) such that P = ker(a k , b k ), k = 1, 2. Choose also two permutations ϕ 1 , ϕ 2 ∈ H such that ϕ k (a k , b k ) = (i, j). Then, if the pairs (a k , b k ) are distinct, the permutations ϕ k must also be distinct. Consequently, the sum above counts every permutation in H exactly once, so the result must be equal to |H |. H ∈ S n and a, b, H (k, l). To show that C H = C H , we can essentially copy the proof of Proposition 4.17 replacing Aut K by H . To prove the inclusion ⊇, take any σ ∈ H and show that the associated permutation matrix A σ satisfy the intertwiner relations A σ ξ a = ξ a with ξ a =T ∅a H . This is equivalent with saying that #{ϕ ∈ H | ϕ(a) = i} = #{ϕ ∈ H | (σ • ϕ)(a) = i}, which is obviously true.

Proposition 5.9 Consider
To prove the opposite inclusion, it is enough to check that taking any σ ∈ S n satisfying the intertwiner relations of C H , we necessarily have σ ∈ H . We get this by choosing a = i = (1, . . . , n) since then Proof We denote by G the quantum group corresponding to the representation category C H and show that G =ˆ H . The proof is basically the same as in case of Theorem 4.18. In particular, thanks to Lemma 5.8, we can do the "partition tricks" also here. For instance, we immediately know that G ⊆Ẑ * n 2 S n sinceT (n) ∈ C H . The linear independence was proven in Proposition 5.10.
Funding Open Access funding enabled and organized by Projekt DEAL.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.