Next Article in Journal
Experimental Study of Excessive Local Refinement Reduction Techniques for Global Optimization DIRECT-Type Algorithms
Previous Article in Journal
Exploring Online Activities to Predict the Final Grade of Student
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Natural Transformations between Induction and Restriction on Iterated Wreath Product of Symmetric Group of Order 2

1
Department of Mathematical Sciences, United States Military Academy, West Point, NY 10996, USA
2
Department of Mathematics, United States Naval Academy, Annapolis, MD 21402, USA
3
Institute of Information Technologies, Gebze Technical University, İstanbul 41400, Turkey
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(20), 3761; https://doi.org/10.3390/math10203761
Submission received: 20 September 2022 / Revised: 8 October 2022 / Accepted: 9 October 2022 / Published: 12 October 2022
(This article belongs to the Section Mathematical Physics)

Abstract

:
Let C A n = C [ S 2 S 2 S 2 ] be the group algebra of an n-step iterated wreath product. We prove some structural properties of A n such as their centers, centralizers, and right and double cosets. We apply these results to explicitly write down the Mackey theorem for groups A n and give a partial description of the natural transformations between induction and restriction functors on the representations of the iterated wreath product tower by computing certain hom spaces of the category of m 0 ( A m , A n ) bimodules. A complete description of the category is an open problem.

1. Introduction

Representation theory of symmetric groups is a classical and rich subject. The study of their irreducible representations has been initiated by Schur (cf. [1]). Today, we have a well-developed theory of representations of symmetric groups in characteristic zero. Symmetric groups form a tower of groups
S 0 S 1 S 2 S n
via the inclusions S n S n + 1 , s i = ( i , i + 1 ) s i , for example. Hence, once the representation category of symmetric groups is understood, one can study the induction and restriction functors on these categories.
The functors Ind and Res are biadjoint and are related through Mackey’s theorem. In 2010, using this relation, Khovanov described a category (known as the Heisenberg category) which governs the natural transformations between induction and restriction functors between representations of the symmetric groups (cf. [2]).
Today, we have more general Heisenberg categories, which are quantized, have a central charge c, and depend on a choice of a graded Frobenius superalgebra F, where { F S n } n N play the role of the symmetric groups in Khovanov’s construction, see e.g., [3,4,5,6,7,8].
In this paper, we investigate induction and restriction functors arising from a different tower, namely the tower of iterated wreath products of symmetric groups of order two. Intuitively, we work with the tower A 0 A 1 A 2 , where A 0 = { id } , A 1 = S 2 and A n = S 2 A n 1 for n 2 and study the categories A n with objects m 0 ( A m , A n ) bimodules and with morphisms bimodule homomorphisms. Induction and restriction functors can be identified with tensoring with certain bimodules; therefore, the morphisms in the category A n correspond to natural transformations between these functors. We will denote by C n the C -linear additive category whose objects are generated by compositions of induction and restriction functors between groups A k , which start from A n . Morphisms of C n are natural transformations between the induction and restriction functors.
Since every finite-dimensional group algebra is a Frobenius algebra, the tower { A n } n N consists of Frobenius algebras. However, this tower is fundamentally different than the towers in Savage’s papers in that we do not take wreath products with symmetric groups increasing in size. Instead, we are iterating the wreath product.
We mention some other work related to the iterated wreath products for the interested reader. In [9], the authors consider the iterated wreath products of Z / n Z and describe a correspondence between their irreducible representations and certain rooted trees. Such a correspondence allows them to determine the Bratelli diagram for their tower of groups. In [10], the first author and Angela Wu generalize these results to iterated wreath products of cyclic groups of various orders. As a follow up, in [11], they generalize their results to iterated wreath products of symmetric groups of various sizes. Our focus is not the representations themselves but the induction and restriction between them as well as natural transformations between induction and restriction. In [12], the authors introduce a notion of foams and relations on them to interpret functors and natural transformations in categories of representations of certain iterated wreath products, leading toward a discussion of patched surfaces with certain defects and their connections to separable field extensions and Galois theory.
In order to describe the category C n or A n , one needs to establish certain structural properties of the groups A n . In Section 2, we provide background on rooted trees and its connection to the construction of iterated wreath products. In Section 3, we prove results about the right cosets, centers, centralizer algebras, and double cosets of A n ’s. In Section 4, we consider Hom A n ( Ind k 1 Res l 1 , Ind k 2 Res l 2 ) , where k 1 l 1 = k 2 l 2 , l 1 n and l 2 n . We provide an explicit vector space basis for End A n ( Ind k Res l ) in Proposition 9, and we construct a generating set of End n ( Ind k ) in Theorem 4. In Section 5, we conclude by discussing many interesting open problems, in particular, in connection to the Heisenberg categories.

2. Rooted Trees and Iterated Wreath Products

Iterated wreath products of cyclic groups or permutation groups can be seen as automorphism groups of certain rooted trees (cf. [9,10,11,12]). A rooted tree is a connected simple graph with no cycles and with a distinguished vertex, which is called a root. A vertex is in the j-th level of a rooted tree if it is at distance j from the root. The branching factor of a vertex is its number of children, and a leaf is a vertex with branching factor zero.
A complete binary tree T n of height n is a rooted tree with all of its leaves at level n, and whose vertices that are not leaves all have branching factor 2.
A labeled complete binary tree is a complete binary tree whose children are labeled 1 , 2 , , 2 n . Without loss of generality, we will also denote a labeled tree by T n .
The wreath product A n : = S 2 S 2 of the group A n 1 with S 2 is ( A n 1 × A n 1 ) × S 2 with the multiplication given by ( a ; σ ) ( b ; λ ) = ( a b σ ; σ λ ) , where b σ corresponds to swapping the components of an element b A n 1 × A n 1 if σ is not the identity of S 2 , and b σ = b if σ is the identity of S 2 . The symmetric group of degree 2 n has as its Sylow 2-subgroup the n-step iterated wreath product of S n . Writing e to be the identity element in the wreath product A n 1 and e to be the identity element in S 2 , the group S 2 { ( e ; σ ) : σ S 2 } and A n 1 { ( a ; e ) : a A n 1 } . This identification shows that the wreath product is precisely the semi-direct product of A n 1 by S 2 .
Another way to think of the wreath product is through automorphism groups of rooted trees. An automorphism of a tree T n with vertex set V is a bijection f : V V such that u , v V are adjacent if and only if f ( u ) and f ( v ) are adjacent. These automorphisms of T n form a group under composition. So, the wreath product S 2 S 2 of the group A n 1 with S 2 may be identified with the automorphism group of complete binary tree of height n that permutes the two children of each node.
That is, let A 1 = S 2 and A n = A n 1 S 2 for n 2 . The iterated wreath product A n may be seen as the automorphism group of T n , since A n 1 S 2 means take two copies of A n 1 and permute them. One can see the two branches coming out of the root of T n as two copies of the tree T n 1 , and an automorphism of T n can leave those two branches fixed or swap them (which then becomes the action of S 2 on two copies of the wreath product A n 1 ).
We will denote the root of a rooted tree with an empty circle. See, e.g., Mathematics 10 03761 i001.
With the tree picture in mind, there are two natural choices for embedding the wreath product A n into A n + 1 . One can either add new branches to the top of a tree, or one can take two copies of a tree of height n and connect them through a new root.
The first one preserves the root of the tree; hence, we call it tree embedding of the wreath product and denote it as i T : A n A n + 1 . For example,Mathematics 10 03761 i002
The second one, although it does not preserve the root of T n , is more convenient to work with when one wants to identify elements of A n with permutations of the leaves. If we label the leaves of a tree from 1 to 2 n , then each tree automorphism can be seen as a permutation in S 2 n . In the second embedding, the expression of a permutation and its image are the same in cycle notation, since the labeling of the leaves is preserved. Hence, this embedding will be called permutation embedding and will be denoted as i p : A n A n + 1 . For example,Mathematics 10 03761 i003.
Automorphisms of T n are determined by whether two children of each vertex are swapped or not. We will represent these swaps by dotted arrows on the diagram of a rooted tree. When reading a tree automorphism from the tree diagram, we apply the swaps from the bottom-most layer to the top-most layer, where the root of the tree is considered to be at the bottom.
From this point forward, we will work with the permutation embedding, and write i : = i p .
Example 1.
The wreath product A 1 = S 2 = { e , ( 1 , 2 ) } can be thought of as the set of automorphisms of the tree
Mathematics 10 03761 i004
where the vertices of the top layer are labeled 1 and 2 when reading from left to right. That is, there is an isomorphism A 1 Aut ( T 1 ) of groups, whereMathematics 10 03761 i005
Example 2.
Consider A 2 = S 2 S 2 = ( S 2 × S 2 ) S 2 = { ( a , b ; c ) | ( a , b ) S 2 × S 2 , c S 2 } . Given the complete binary tree
Mathematics 10 03761 i006,
the map A 2 Aut ( T 2 ) is a group homomorphism, where the isomorphism is indicated via sending
Mathematics 10 03761 i007.
We thus have an embedding of i : A 1 A 2 , where i ( A 1 ) maps to the automorphisms of T 2 that fixes vertices 3 and 4, i.e., the right branch in the blue circle is fixed. See Figure 1. This gives us a map A 1 Aut ( T 2 ) , which is given by
Mathematics 10 03761 i008.
Note that there is also an embedding j : A 2 S 4 of the wreath product A 2 into the symmetric group S 4 on 4 letters, where one just keeps track of the labels on the top of the labeled tree T 2 . For example ( ( 1 , 2 ) , e ; e ) ( 1 , 2 ) and ( e , e ; ( 1 , 2 ) ) ( 1 , 3 ) ( 2 , 4 ) .
Example 3.
The group A 3 has a canonical identification with the automorphism group of the tree
Mathematics 10 03761 i009.
Furthermore, the permutation embedding i : A 2 A 3 gives rise to the identification between A 2 and the automorphisms of T 3 that fixes the children of level 2 vertices fixed on the right branch:Mathematics 10 03761 i010
Therefore, A n is isomorphic to the automorphism group of a complete rooted binary tree T n of height n, and A n 1 is isomorphic to the subgroup of the automorphism group of T n , which fixes the children of level n 1 vertices.
We will denote by A ^ n the image of A n inside A n + 1 induced by the map
1 , 2 , , 2 n 2 n + 1 , 2 n + 2 , , 2 n + 1 ,
which sends the label k to the label 2 n + k , where 1 k 2 n , and by β n + 1 , the permutation ( 1 , 2 n + 1 ) ( 2 , 2 n + 2 ) ( 2 n , 2 n + 1 ) .
Note that in terms of the tree T n + 1 , A n is the automorphism of the children of the leftmost branch growing from level 0, A ^ n is the automorphism of the children of the rightmost branch growing from level 0, and β n + 1 is the automorphism of the tree T n + 1 which swaps A n and A ^ n .
Example 4.
When n = 2 , A ^ 2 is the automorphism of the subtree of T 3 indicated by the dotted edges:
Mathematics 10 03761 i011,
and β 3 is the tree automorphism given below:
Mathematics 10 03761 i012.
We will make a systematic use of the following observations in the rest of the paper:
Lemma 1.
The groups A n and A ^ n commute.
Proof. 
A n only acts on the label set L 1 = { 1 , 2 , , 2 n } and A ^ n only acts on the label set L 2 = { 2 n + 1 , 2 n + 2 , , 2 n + 1 } . Hence, acting on disjoint labels, these two subgroups commute with each other, i.e., A n A ^ n = A ^ n A n . □
Remark 1.
The automorphism β n + 1 is the only link between the two branches A n and A ^ n .
Lemma 2.
Conjugating A n by β n + 1 gives A ^ n .
Proof. 
Conjugating g A n by β n + 1 is same as applying the permutation β n + 1 to the labels of g; hence, the resulting element is an element of A ^ n obtained by replacing i with 2 n + i in the cycle notation of g. Therefore, one has A n β n + 1 = β n + 1 A ^ n . □
Example 5.
Consider the transposition g = ( 1 , 2 ) A 2 . Then
β 3 1 g β 3 = ( β 3 ( 1 ) , β 4 ( 3 ) ) = ( 5 , 6 ) A ^ n
by Lemma 2.
Note that { β i } i = 1 , , n is a set of generators for A n . In terms of the tree diagrams, these elements correspond to swaps at leftmost nodes at every level of the tree. The automorphism β 1 corresponds to the top level, furthest away from the root.
We will also be referring to groups A ^ n and A ^ n + 1 as the subgroups of A n + 2 (Figure 2).
For example, in T 4 , we have
Mathematics 10 03761 i013
where
Mathematics 10 03761 i014,
and
Mathematics 10 03761 i015.

3. Structural Properties of the Iterated Wreath Products of S 2

This section provides results about the centers, centralizers, cosets and their representatives for the groups A n , which will be needed in the rest of the paper.
Recall that β i is the permutation on the leftmost vertex at the level i of the binary tree T n . We start by citing a generators and relations description of iterated wreath products of symmetric groups.
Theorem 1
(Theorem 1.2, [9]). The group A n is given by generators β 1 , , β n with relations
1.
β i 2 = id for 1 i n ,
2.
( β i β j ) 4 = id for i j , 1 i , j n , and
3.
( β i β j β i β j + k ) 2 = id for j > i and 1 k n i .
Proposition 1.
The group A n + l + 1 decomposes as the disjoint union
x B n , l + 1 { id } A n A ^ n A ^ n + 1 A ^ n + 2 A ^ n + l x ,
where
B n , l + 1 : = β I : = β i 1 β i 2 β i s | I = ( i 1 , i 2 , , i s ) w h e r e n < i 1 < i 2 < < i s n + l + 1 .
Proof. 
We will prove by induction on l.
Case l = 0 . This is easy to see when one considers A n + 1 as the automorphism group of the truncated tree T n + 1 . Such an automorphism either contains a swap at the root of the tree, i.e., β n + 1 , or not. Automorphisms that do not contain β n + 1 consist of combinations of swaps at higher levels of the tree, so they are elements of A n A ^ n . Note that since elements of A n and A ^ n commute, this set is the same as A ^ n A n . The remaining automorphisms should contain β n + 1 and may contain any other swap, so they are elements of A n A ^ n β n + 1 . Hence, A n + 1 = A n A ^ n A n A ^ n β n + 1 .
Note that one can also express the set A n A ^ n β n + 1 as β n + 1 A n A ^ n = β n + 1 A ^ n A n = A n β n + 1 A n = A ^ n β n + 1 A ^ n using Lemma 2.
Inductive step. Suppose the proposition holds for A n + l for some l; that is, A n + l is the disjoint union
A n + l = x B n , l { id } A n A ^ n A ^ n + 1 A ^ n + l 1 x .
Since A n + l + 1 = A n + l A ^ n + l A n + l A ^ n + l β n + l + 1 , by replacing A n + l with the expression in (1) one obtains
A n + l + 1 = x B n , l 1 { id } A n A ^ n A ^ n + l 1 x A ^ n + l
x B n , l 1 { id } A n A ^ n A ^ n + l 1 x A ^ n + l β n + l + 1
= x B n , l 1 { id } A n A ^ n A ^ n + l 1 A ^ n + l x
x B n , l 1 { id } A n A ^ n A ^ n + l 1 A ^ n + l x β n + l + 1
= x B n , l { id } A n A ^ n A ^ n + l x .
This concludes the proof. □
Proposition 2.
The set of right cosets A n A n + l + 1 decomposes as the disjoint union
A n A n + l + 1 = x B n , l + 1 { id } A n A n A ^ n A ^ n + 1 A ^ n + 2 A ^ n + l x ,
where
B n , l + 1 : = β I : = β i 1 β i 2 β i s : I = ( i 1 , i 2 , , i s ) w h e r e     n < i 1 < i 2 < < i s n + l + 1 .
Proof. 
It is enough to show that the sets A n A ^ n A ^ n + 1 A ^ n + 2 A ^ n + l x that partition A n + l + 1 are invariant under left multiplication by g A n . However, this is obvious, since g A n = A n implies that
g A n A ^ n A ^ n + 1 A ^ n + l x = A n A ^ n A ^ n + 1 A ^ n + l x .
Proposition 3.
A set of representatives for the right cosets A n A n + l + 1 is given by the disjoint union x B n , l + 1 { id } A ^ n A ^ n + 1 A ^ n + 2 A ^ n + l x .
Proof. 
By Proposition 2, we have
{ A n g } g A n + l + 1 = x B n , l + 1 { id } { A n g } g A n A ^ n A ^ n + 1 A ^ n + 2 A ^ n + l x = x B n , l + 1 { id } { A n h } h A ^ n A ^ n + 1 A ^ n + 2 A ^ n + l x = x B n , l + 1 { id } h A ^ n A ^ n + 1 A ^ n + 2 A ^ n + l x A n h ,
which completes the proof. □
Remark 2.
For l = 0 Proposition 3 reduces to the statement that a set of representatives for the right cosets A n A n + 1 is given by A ^ n A ^ n β n + 1 .
Lemma 3.
The center of A n is
Z ( A n ) = { id , ( 1 , 2 ) ( 3 , 4 ) ( 2 n 1 , 2 n ) } .
Proof. 
Let α Z ( A n ) and consider the generating set B = { β 1 , β 2 , , β n } of A n where β k = i = 1 2 k ( i , 2 k + i ) . We know that α should satisfy α β k α 1 = β k for all β k B . Conjugation by a permutation has the effect of relabeling; hence, we obtain
α β k α 1 = i = 1 2 k ( α ( i ) , α ( 2 k + i ) ) = i = 1 2 k ( i , 2 k + i ) = β k .
This equation puts a restriction on α for each k { 1 , , n } .
For k = 1 , we obtain ( 1 , 2 ) = ( α ( 1 ) , α ( 2 ) ) , so either α fixes 1 and 2, or it swaps 1 and 2.
For k = 2 , we obtain ( 1 , 3 ) ( 2 , 4 ) = ( α ( 1 ) , α ( 3 ) ) ( α ( 2 ) , α ( 4 ) ) , so if α fixes 1 , 2 , we must have ( 1 , 3 ) ( 2 , 4 ) = ( 1 , α ( 3 ) ) ( 2 , α ( 4 ) ) , which forces α to fix 3 and 4 as well. Otherwise, if it swaps 1 and 2, we obtain ( 1 , 3 ) ( 2 , 4 ) = ( 2 , α ( 3 ) ) ( 1 , α ( 4 ) ) , which forces α to swap 3 and 4 as well.
Since Equation (7) holds for k = 0 , 1 , , n 1 , repeating similar arguments, we obtain that either α = id , or α = ( 1 , 2 ) ( 3 , 4 ) ( 2 n 1 , 2 n ) . □
Define the centralizer of A n in A n + k as
Z n , k : = Z ( A n + k , A n ) = g A n + k : g h = h g     for     all     h A n .
We note that the usual notation in group theory for the centralizer is C A n + k ( A n ) .
Lemma 4.
The centralizer Z n , 1 of A n in A n + 1 is equal to Z ( A n ) A ^ n .
Proof. 
Again, it will suffice to work with the generators B = { β 1 , β 2 , , β n } of A n . Let α = a b , where a Z ( A n ) and b A ^ n . Then, α β k = a b β k = a β k b = β k a b = β k α , where the second equality holds, since A ^ n commutes with A n (see Lemma 1) and the third equality holds, since a is in the center of A n .
On the other hand, for α Z n , 1 , the condition α β k α 1 = β k for k { 1 , , n } forces α to either fix 1 , 2 , , 2 n , or to swap 1 and 2, 3 and 4,⋯, 2 n 1 and 2 n , and there are no restrictions on the labels { 2 n + 1 , , 2 n + 1 } . Since A ^ n is the subgroup of A n + 1 that permutes these labels in any possible way, α is of the form a b , where a Z ( A n ) and b A ^ n . Therefore, Z n , 1 = Z ( A n ) A ^ n . □
Lemma 5.
A n β n + 1 A n is an ( A n , A n ) -double coset of A n + 1 with | A n | 2 elements.
Proof. 
We want to show that the elements x β n + 1 y are all distinct for x , y A n . So, suppose x β n + 1 y = x β n + 1 y , where x , y , x , y A n . Then, ( x ) 1 x = β n + 1 y y 1 β n + 1 1 . However, conjugation by β n + 1 has the effect of sending labels { 1 , 2 , , 2 n } to { 2 n + 1 , , 2 n + 1 } . So, the permutations ( x ) 1 x and β n + 1 y y 1 β n + 1 1 are acting on disjoint sets in a partition of all the labels for A n + 1 . So, ( x ) 1 x = β n + 1 y y 1 β n + 1 1 = id implies x = x and y = y . This proves that x β n + 1 y are all distinct for x , y A n . Hence, A n β n + 1 A n is a ( A n , A n ) -double coset of A n + 1 with | A n | 2 elements. □
Proposition 4.
The elements A ^ n { β n + 1 } form a complete set of representatives for ( A n , A n ) -double cosets of A n + 1 .
Proof. 
We will provide a proof by showing that each of these representatives gives disjoint double cosets, and by using a counting argument, i.e., their total cardinality is equal to the cardinality of A n + 1 .
For b A ^ n Z n , 1 , we obtain A n b A n = b A n since elements in A n and A ^ n commute. This gives us | A n | disjoint double cosets (they are disjoint because each b corresponds to a different swap at the right branch of the tree T n + 1 ), each with | A n | elements. So, the double cosets A n b A n for b A ^ n count for | A n | | A n | many elements of A n + 1 .
Since the cardinality of A n + 1 is | A n + 1 | = | A n S 2 | = | ( A n × A n ) S 2 | = 2 | A n | 2 , there are still 2 | A n | 2 | A n | | A n | elements we have to account for.
Note that A n + 1 = A n A ^ n A n A n β A n = A n A ^ n A n β A n . It follows from Lemma 4 that each element of A ^ n gives a distinct double coset of size | A n | , and it follows from Lemma 5 that β n + 1 gives a double coset of size | A n | 2 . This counts for all the elements of A n + 1 . □
Proposition 5.
A basis of the subalgebra C Z n , k is given by the orbit sums of the conjugation action A n A n + k .
This is an application of the classical yet extremely powerful idea of averaging over group elements ubiquitous in representation theory. We will now prove Proposition 5.
Proof. 
Let O be an orbit and let v O = g O g . Then for any a A n , we have
a v O = a g O g = g O a g = g O g a = g O g a = v O a .
Hence, v O C Z n , k .
Conversely, let v = c 1 v h 1 + + c k v h k Z n , k where { v h i } h i A n + k is a basis of C A n + 1 and suppose that v v g = v g v for all g i ( A n ) . Then, we have
i = 1 k c i v h i = v = v g v v g 1 = i = 1 k c i v g v h i v g 1 = i = 1 k c i v g h i g 1
Since this is true for all g A n , all the basis vectors v h j for h j in the orbit of h i should be present in v for all i = 1 , 2 , , k . Moreover, in order for the above equation to hold, one needs the coefficients of the basis vectors indexed by elements from the same orbit to be equal to each other. Therefore, { v O } O orbit is a basis of C Z n , k . □
There is a special element whose orbit exhibits a notable behavior. The orbit of β n + 1 is the same under the conjugation actions of A n and A n + 1 .
Proposition 6.
Let O n ( β n + 1 ) : = { h β n + 1 h 1 : h A n } be the orbit of β n + 1 under the conjugation action of A n on A n + 1 , and let O n + 1 ( β n + 1 ) : = { g β n + 1 g 1 : g A n + 1 } be the orbit of β n + 1 under the conjugation action of A n + 1 on A n + 1 , i.e., the conjugacy class of β n + 1 in A n + 1 . Then, O n ( β n + 1 ) = O n + 1 ( β n + 1 ) .
Proof. 
Note that β n + 1 is a product of transpositions of the form ( 1 , 2 ) where 1 L 1 = { 1 , , 2 n } , 2 L 2 = { 2 n + 1 , , 2 n + 1 } . Conjugation by h A n has the effect of permuting only the labels from the set L 1 .
Conjugation by g A n + 1 affects both the labels 1 and 2 . Every g can be written as h β n + 1 k for h A n and k A ^ n . Here, only β n + 1 can exchange labels between L 1 and L 2 ; however, note that no matter which element of A n + 1 we choose, we can never obtain a permutation containing ( 1 , 1 ) since if β n + 1 ( 2 ) is in L 1 , then β n + 1 ( 1 ) should be in L 2 .
Therefore, conjugates of β n + 1 are products of transpositions ( 1 , 2 ) , which can all be obtained by conjugation with h A n . Hence O n ( β n + 1 ) = O n + 1 ( β n + 1 ) . □
Remark 3.
Let o n ( g ) denote the sum of the elements in the orbit O n ( g ) , i.e., o n ( g ) = g O n ( g ) g . Note that o n + 1 ( β n + 1 ) is a central element of C A n + 1 since it is a conjugacy class sum. As a result, we obtain that o n ( β n + 1 ) is also central in C A n + 1 .
Now, we are in a position to give an explicit vector space basis of C Z n , 1 .
Proposition 7.
The number of orbits of the conjugation action A n A n + 1 is | A n | × ( c n + 1 ) where c n is the number of conjugacy classes of A n . Moreover, if we denote by C n ( g ) the conjugacy class of g A n , then the orbits are C n ( g ) h g A n , h A ^ n and O n ( β n + 1 ) h h A ^ n .
Proof. 
We will use the decomposition A n + 1 = A n A ^ n A n A ^ n β n + 1 . Since A n and A ^ n commute, the action of A n on A n A ^ n results in orbits of the form C n ( a ) h for a A n , h A ^ n where C n ( a ) is the conjugacy class of a in A n .
As for the action on A n A ^ n β n + 1 , note that we have the equalities
A n A ^ n β n + 1 = A n β n + 1 A n = β n + 1 A ^ n A n = β n + 1 A n A ^ n = A ^ n β n + 1 A ^ n
Therefore, if we choose to work with A ^ n β n + 1 A ^ n , for g A n and h ^ , k ^ A ^ n ,
g h ^ β n + 1 k ^ g 1 = h ^ g β n + 1 g 1 k ^ .
Hence, we obtain orbits h ^ O n ( β n + 1 ) k ^ . Since O n ( β n + 1 ) is equal to the conjugacy class O n + 1 ( β n + 1 ) in A n + 1 by Proposition 6 and any k ^ A ^ n can be expressed as h ^ 1 ^ k , h , we obtain
h ^ O n ( β n + 1 ) k ^ = h ^ O n ( β n + 1 ) h ^ 1 ^ k , h = O n ( β n + 1 ) ^ k , h .
Therefore, the orbits are of the form O n ( β n + 1 ) h for h A ^ n . □
This determines a basis for C Z n , 1 and its dimension is | A n | ( c n + 1 ) . To obtain an explicit formula for this dimension, we need an explicit formula for the number of conjugacy classes of A n , which is same as the number of irreducible representations of A n .
We restrict Theorem 2.2 in [9] to r = 2 to obtain the number of conjugacy classes:
Theorem 2
(Orellana–Orrison–Rockmore). The number c n of irreducible representations of A n is given by c 0 = 1 and the recursion
c n = 1 2 c n 1 ( 3 + c n 1 ) .
Note that the sequence { c n } n N appears in OEIS as sequence (A006893) https://oeis.org/search?q=A006893&language=english.
The following proposition describes the orbits of the action A n A n + k + 1 . An explicit vector space basis for C Z n , k + 1 is given by their orbit sums.
Proposition 8.
The number of orbits of the conjugation action A n A n + k + 1 is | A n | | A n + 1 | | A n + k | ( c n + a k ) where c n is the number of conjugacy classes of A n , a k is the sequence defined recursively as a 0 = 0 , a r = 2 a r 1 + 1 for r > 0 .
Moreover, if we denote by c n ( g ) the conjugacy class sum of g in A n , then the orbits are
1.
c n ( g ) h : h A ^ n A ^ n + 1 A ^ n + k for g A n and
2.
O n ( β I ) h : h A ^ n A ^ n + 1 A ^ n + k ,
where β I are from the set B n , k + 1 { id } .
Proof. 
We will give a proof by induction on k. The base case k = 0 is proved in Proposition 7. Now, assume the proposition holds for some k. We will make use of the decomposition A n + k + 1 = A n + k A ^ n + k β n + k + 1 A n + k A ^ n + k . This decomposition allows us to describe the orbits by studying the action of A n on A n + k A ^ n + k and on β n + k + 1 A n + k A ^ n + k separately.
For the action of A n on A n + k A ^ n + k , since A n and A ^ n + k commute, for g A n , h A n + k , j A ^ n + k , we obtain g h j g 1 = g h g 1 j . Therefore, the orbits of the action of A n on A n + k A ^ n + k are given by orbits of A n on A n + k times an element of A ^ n + k .
Now, for the action A n β n + k + 1 A n + k A ^ n + k , since we have
A n + k = A n + k 1 A ^ n + k 1 β n + k A n + k 1 A ^ n + k 1
using this relation inductively, one ends up with
A n + k = β I B n , k { id } β I A n A ^ n A ^ n + 1 A ^ n + k 1
and obtains
β n + k + 1 A n + k A ^ n + k = β I B n , k { id } β n + k + 1 β I A n A ^ n A ^ n + 1 A ^ n + k 1 A ^ n + k = β I B n , k + 1 { id } β I A n A ^ n A ^ n + 1 A ^ n + k .
For g , r A n , m ^ A ^ n A ^ n + 1 A ^ n + k , we want to study g β I r m ^ g 1 . Note that it is possible to express m ^ as r ^ 1 ^ r , m , where β I r ^ 1 = r 1 β I . Hence, we obtain
g β I r m ^ g 1 = g β I r r ^ 1 ^ r , m g 1 = g β I r ^ 1 r ^ r , m g 1 = g r 1 β I r ^ r , m g 1 = g r 1 β I r g 1 ^ r , m ,
ending up with orbits of the form O n β I h , where β I B n , k + 1 { id } and h A ^ n A ^ n + 1 A ^ n + k .

4. Natural Transformation between Induction and Restriction

Let the symbol n ( k ) m denote the C A k as an ( A n , A m ) -bimodule.
Objects of the category A n = m N ( A m , A n ) - bimod are generated by ( A m , A n ) -bimodules for a fixed n. Since Ind n n + 1 and Res n n 1 correspond to n + 1 ( n + 1 ) n n and n 1 ( n 1 ) n n , respectively, one can identify the bimodules n + 1 ( n + 1 ) n and n 1 ( n 1 ) n with Ind n n + 1 and Res n n 1 , respectively. Therefore, it is possible to describe the category A n in terms of compositions of Ind and Res and natural transformations between them as well. Let us denote by C n the category whose objects are generated by compositions of induction Ind and restriction Res functors between groups { A k } k N , where the compositions start from induction or restriction from A n .
Given a sequence of inductions and restrictions, using the formula (11) below, it is possible to move inductions to the left and push restrictions to the right. Hence, objects of C n are given by direct sums of Ind k Res l starting from ( n , n ) -bimodules.
Morphisms of C n consist of sets Hom C n ( Ind k 1 Res l 1 , Ind k 2 Res l 2 ) . Since we start by applying the restrictions to an ( n , n ) -bimodule, it is clear that these hom spaces are trivial when l 1 > n or l 2 > n . In addition, note that when k 1 l 1 k 2 l 2 , we are talking about bimodule maps between two bimodules over different rings. Therefore, in this case, the hom space is trivial as well.
From now on, we will assume that k 1 l 1 = k 2 l 2 , l 1 n and l 2 n . We would like to describe the spaces Hom A n ( Ind k 1 Res l 1 , Ind k 2 Res l 2 ) , or Hom n ( + k 1 l 1 , + k 2 l 2 ) for short, as a vector space and as an algebra.
In this section, we describe all these spaces implicitly and provide explicit descriptions for the cases k 1 = k 2 = k (hence l 1 = l 2 = l ) and l = 0 , 1 .

4.1. Mackey Theorem

Let us start by recalling the general form of Mackey theorem for induction and restriction.
Theorem 3
(Mackey Theorem). Let G be a finite group and H , K be two subgroups of G. Then
Res G K Ind H G = g i I Ind K H g i K Res H K H g i ,
where I is a set of ( H , K ) -double coset representatives of G and H g : = g H g 1 .
In our case, by letting G = A n + 1 and H = K = A n , we obtain
Res A n + 1 A n Ind A n A n + 1 = g i I Ind A n A n g i A n Res A n A n A n g i ,
where I = A n A n + 1 / A n .
Using Proposition 4 which informs us about double cosets, we can express the above formula more explicitly once we say something about A n A n g for double coset representatives g. We will work with the double coset representatives { b A ^ n } { β n + 1 } .
For b A ^ n , A n b = b A n b 1 = A n , since A n and A ^ n commute. Hence, the intersection of A n and A n b is again A n .
For β n + 1 , we have A n β n + 1 = β n + 1 A n β n + 1 = A ^ n ; hence, A n A n β n + 1 = { id } = A 0 . Therefore, the Mackey formula for the groups A n gives
Res A n + 1 A n Ind A n A n + 1 = Ind A 0 A n Res A n A 0 Id | A n | .
The fact that the number of summands of Id on the right-hand side of (11) depends on n suggests that this line of investigation should be different than the Heisenberg categories in the literature. More precisely, there should not exist an abstract 1-category C encapsulating the induction and restriction functors on the tower A 0 A 1 A 2 and natural transformation between them which will act on the categories A n = m N ( A m , A n ) - bimod for all n as bimodule homomorphisms. Therefore, we will focus on describing the explicit categories A n = m N ( A m , A n ) - bimod .
Note that given the induction functor
Ind n n + 1 : ( C A n , C A n ) - bimod ( C A n + 1 , C A n ) - bimod , we want to describe the natural transformations End n ( Ind n n + 1 ) such that the diagram
Mathematics 10 03761 i016
commutes, where h : C A n C A n is an ( C A n , C A n ) -bimodule homomorphism. Suppose f ( id ) = a C A n + 1 . Then, for any α C A n + 1 and β C A n , f ( α x β ) = α f ( x ) β = α x a β , where f ( x ) is multiplication by a from the right. On the other hand, f ( α x β ) = α x β a . So, β a = a β for any β C A n implies f End ( Ind n n + 1 ) if and only if the bimodule homomorphism f is multiplication by an element from the centralizer Z n , 1 .

4.2. Morphism Spaces as Vector Spaces

In this subsection, we give a description of the morphism spaces between induction and restriction functors on the representations of the tower
A 1 i 1 A 2 i 2 A 3 i 3 .
as vector spaces.
Unlike the case for symmetric groups (cf. Theorem 2.1 in [13]), the centralizer for our tower of group algebras forms a non-commutative algebra. The size of our groups grows exponentially, and as a consequence, Res is not multiplicity free for this tower.
End C n ( Ind k Res l ) consists of natural transformation satisfying the following diagram: Mathematics 10 03761 i017
In terms of bimodules, this amounts to Mathematics 10 03761 i018
where r = k l . Therefore, if f ( 1 n l 1 ) = y C A n + r n l C A n , for a C A n + r , b C A n l , we require that
a y b = a f ( 1 n l 1 ) b = f ( a n l b ) = f ( a b n l 1 ) = a b y .
This calculation shows that
End n ( Ind k Res l ) = { x C A n + r n l C A n : g x = x g for     all     g A n l } .
For l = 0 , we obtain that
End n ( Ind k ) = Z ( C A n + k , C A n ) ,
which is the centralizer of the image of A n inside C A n + k . Let us denote it with C Z n , k . A vector space basis of C Z n , k , hence of End n ( Ind k ) , is given explicitly by orbit sums described in Proposition 8.
Using the biadjointness between Ind and Res , one immediately obtains a similar result for End n ( Res k ) .
Lemma 6.
End n ( Res k ) is isomorphic to End n ( Ind k ) as a vector space, and it is isomorphic to its opposite algebra as an algebra.
Proof. 
The induction and restriction functors form a cyclic biadjoint pair for a finite group G and one of its subgroups H, i.e., see Section 3.2 in [2]. This relationship allows one to deduce the structure of End n ( Res k ) as a vector space and as an algebra.
Alternatively, in terms of bimodule homomorphisms, the natural transformations between Ind correspond to bimodule maps of multiplication on the right, and the ones for Res correspond to bimodule maps of multiplication on the left. Hence, one obtains the same vector space, and the algebra multiplication reverses the order. □
Although we can provide a nice description for the vector space structure of End n ( Ind k ) and End n ( Res k ) , the picture changes slightly for End n ( Ind k Res l ) when l 0 since in this case, a vector space basis is given by the orbit sums of the conjugation action of A n on the tensor product C A n + k l n l C A n , which is not a group algebra. So, even though one can give an explicit description of orbit representatives, it is difficult to express the orbit sums explicitly.
Proposition 9.
A vector space basis of End n ( Ind k Res l ) is given by
a h n l b β I h : a A n + k l , b A ^ n l A ^ n l + 1 A ^ n 1 , β I B n l , l { id } h A n ,
where a h : = h a h 1 .
Proof. 
We start by noting that an element of C A n + k l n l C A n can be written as i I c i a i n l b i where c i C , a i A n + k l and b i is a representative from the quotient A n l A n after pushing all possible terms to the left of the tensor. Therefore, { a i n l b i } is a basis of C A n + k l n l C A n . We will choose b i from the set of representatives in the disjoint union
x B n l , l { id } A ^ n l A ^ n l + 1 A ^ n l + 2 A ^ n 1 x ,
given in Proposition 3.
Let us look at the case l = 1 first. In this case, the representatives are A ^ n 1 A ^ n 1 β n . Given a basis element a n 1 b , b is either in A ^ n 1 or in A ^ n 1 β n .
For h A n 1 , a A n + k 1 and b A ^ n 1 , we obtain
h · ( a n 1 b ) = h ( a n 1 b ) h 1 = h a n 1 h 1 b sin ce A ^ n 1 commutes with A n 1 = h a h 1 n 1 b
and
h · ( a n l b β n ) = h ( a n l b β n ) h 1 = h a h 1 n l h b β n h 1 = h a h 1 n l b h β n h 1 = a h n 1 b β n h .
More generally, for any l, if b A ^ n l A ^ n l + 1 A ^ n l + 2 A ^ n 1 , then
h · ( a n l b ) = h ( a n l b ) h 1 = h a n l h 1 b sin ce A ^ n l A ^ n l + 1 A ^ n l + 2 A ^ n 1 commutes with A n 1 = h a h 1 n l b = a h n l b
and
h · ( a n l b β I ) = h ( a n l b β I ) h 1 = h a h 1 n l h b β I h 1 = h a h 1 n l b h β I h 1 sin ce A ^ n l A ^ n l + 1 A ^ n l + 2 A ^ n 1 commutes with A n 1 = h a h 1 n l b h β I h 1 = a h n l b β I h ,
where a h = h a h 1 . □
We do not have an explicit description for Hom n ( Ind k 1 Res l 1 , Ind k 2 Res l 2 ) , where k 1 l 1 = k 2 l 2 but k 1 k 2 .
In the next section, we will describe the algebra structure of the endomorphism spaces.

4.3. Algebra Structure of Morphism Spaces

In [14], the author develops a general approach for obtaining a nice set of multiplicative generators for the Gelfand–Tsetlin subalgebra C Z n = ζ ( C A 1 ) , , ζ ( C A n ) . His approach does not apply directly to our tower of groups, since we are in a non-multiplicity free setting.
The set End n ( Ind n n + 1 ) is closed under precomposing with elements of the center End n ( Id ) Z ( C A n ) of the group algebra. Therefore, the algebra End n ( Ind n n + 1 ) can be decomposed as End n ( Id ) D n , n + 1 , where conjugacy class sums of A n form a basis of End n ( Id ) and A ^ n { o n ( β n + 1 ) } is a spanning set for the algebra D n , n + 1 .
Since the group A ^ n is generated by B ^ = β ^ 1 , β ^ 2 , , β ^ n , a generating set for the algebra D n , n + 1 is given by B ^ { o n ( β n + 1 ) } . The relations among the generators in B ^ are described in Theorem 1. o n ( β n + 1 ) is a central element of C [ A n + 1 ] by Remark 3; therefore, it commutes with the generators in B ^ , i.e., [ o n ( β n + 1 ) , β ^ i ] = 0 . However, this is not enough to give a generators and relations description of the algebra D n , n + 1 . In particular, the only relation missing in order to give a complete generators and relations description D n , n + 1 is the expression of o n ( β n + 1 ) k in terms of the generators. The only nice pattern we have observed is o n ( β n + 1 ) k = 2 k 1 o n ( β n + 1 ) for n = 1 and k odd. In fact, closed formulas are very difficult to find for all the other cases, i.e., n = 1 and k even, and n > 1 . However, working in a concrete setting has the advantage of defining D n , n + 1 as the subalgebra of C A n + 1 generated by B ^ { o n ( β n + 1 ) } .
Thus, to determine the algebra structure of End n ( Ind ) , it remains to describe the algebra structure of End n ( Id ) Z ( C A n ) . It is difficult to express the structure coefficients if one chooses to work with the conjugacy class sums as a basis. Khonvanov’s Heisenberg category provides a way to express centers of symmetric group algebras with generators and relations using a different basis { c i } i N defined via diagrammatics as certain bubbles. We lack a diagrammatic description for our category. We leave the algebra structure of End n ( Id ) Z ( C A n ) as an open problem.
Next, we will write down the generating set for the algebra structure of the endomorphism algebra End n ( Ind 2 ) . Similar as before, End n ( Ind 2 ) decomposes as End n ( Id ) D n , n + 2 , where A ^ n A ^ n + 1 { o n ( β n + 1 ) } { o n ( β n + 2 ) } { o n ( β n + 2 β n + 1 ) } span the algebra D n , n + 2 . Since A ^ n is generated by the swaps B ^ = β ^ 1 , β ^ 2 , , β ^ n and A ^ n + 1 is generated by B ( 1 ) = β 1 ( 1 ) , β 2 ( 1 ) , , β n + 1 ( 1 ) , where β ^ i are the leftmost swaps of A ^ n and β i ( 1 ) are the leftmost swaps in each row in A ^ n + 1 , respectively, a generating set for the algebra D n , n + 2 is given by
B ^ B ( 1 ) o n ( β n + 1 ) , o n ( β n + 2 ) , o n ( β n + 2 β n + 1 ) .
More generally, consider A n acting by conjugation on the group algebra C A n + k + 1 . Then, End n ( Ind k ) decomposes as End n ( Id ) D n , n + k + 1 , where the disjoint union
= 0 k A ^ n + n < j 1 < < j s n + k + 1 o n ( β j s β j 1 ) .
spans the algebra D n , n + k + 1 . The group A ^ n + is generated by
B ( ) = { β 1 ( ) , , β n + ( ) } ,
where β i ( ) are the leftmost swaps in each row in A ^ n + , 0 k . This leads us to the following theorem:
Theorem 4.
The endomorphism algebra End n ( Ind k ) decomposes as
End n ( Id ) D n , n + k + 1 ,
where a generating set for the algebra D n , n + k + 1 is the disjoint union
= 0 k B ( ) n < j 1 < < j s n + k + 1 o n ( β j s β j 1 ) ,
and B ( ) = β 1 ( ) , , β n + ( ) , 0 k (Figure 3).
As mentioned above, since the relations among the algebra generators are very complicated, we will refrain from explicitly writing them but leave this as an open problem.

5. Future Directions

During our investigation of bimodules for the iterated wreath products of cyclic groups of order 2, we have encountered many questions, some of which remain unanswered. To list a few,
  • A complete explicit description of all morphism spaces of C n is unknown. Namely, the spaces Hom n ( Ind k 1 Res l 1 , Ind k 2 Res l 2 ) where k 1 k 2 = l 1 l 2 but k 1 k 2 .
  • A presentation of the algebras D n , n + k appearing in the morphism spaces is unknown. We just have a set of generators and some of the defining relations.
  • Young–Jucys–Murphy’s elements play an important role in the Heisenberg categories. An open question is the analogues of these elements for iterated wreath products.
  • An explicit description for the category of bimodules of the symmetric groups is a difficult question; however, they can be recovered as functorial images of Khovanov’s Heisenberg category. The existence of such an abstract category for iterated wreath products is an open question. One important difference is that the Mackey formula for the symmetric group S n is independent of n, while this formula depends on n for iterated wreath product A n .
  • Heisenberg categories admit diagrammatic interpretations which benefit from the diagrammatics of the symmetric groups. Whether such a description exists for the category C n is an open question.
  • It would be interesting to take iterated wreath products of other cyclic groups or other symmetric groups and compare how their bimodule categories differ from the S 2 case.
  • We do not know the Grothendieck groups or traces of the categories C n .

Author Contributions

M.S.I. and C.O.O. contributed equally in the research aspects and the writing of this article. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by National Academy of Sciences at Washington D.C. and Turkish Scientific and Technological Research Council TUBITAK 115F412.

Data Availability Statement

Data sharing is not applicable to this article as no data sets were generated or analyzed during the current study.

Acknowledgments

The first author would like to acknowledge the Department of Mathematics at Galatasaray University in Turkey for excellent working environment.

Conflicts of Interest

The authors have no conflict of interest to declare that are relevant to the content of this article.

References

  1. Schur, J. On the representation of the symmetric and alternating groups by fractional linear substitutions. Internat. J. Theoret. Phys. 2001, 40, 413–458, Translated from the German [J. Reine Angew. Math. 1911, 39, 155–250] by Marc-Felix Otto. [Google Scholar] [CrossRef]
  2. Khovanov, M. Heisenberg algebra and a graphical calculus. Fund. Math. 2014, 225, 169–210. [Google Scholar] [CrossRef]
  3. Rosso, D.; Savage, A. A general approach to Heisenberg categorification via wreath product algebras. Math. Z. 2017, 286, 603–655. [Google Scholar] [CrossRef] [Green Version]
  4. Savage, A. Frobenius Heisenberg categorification. arXiv 2018, arXiv:1802.01626. [Google Scholar] [CrossRef]
  5. Brundan, J. On the definition of Heisenberg category. Algebr. Comb. 2018, 1, 523–544. [Google Scholar] [CrossRef]
  6. Brundan, J.; Savage, A.; Webster, B. The degenerate Heisenberg category and its Grothendieck ring. arXiv 2019, arXiv:1812.03255. [Google Scholar]
  7. Brundan, J.; Savage, A.; Webster, B. On the definition of quantum Heisenberg category. Algebra Number Theory 2020, 14, 275–321. [Google Scholar] [CrossRef]
  8. Brundan, J.; Savage, A.; Webster, B. Foundations of Frobenius Heisenberg categories. arXiv 2021, arXiv:2007.01642. [Google Scholar] [CrossRef]
  9. Orellana, R.C.; Orrison, M.E.; Rockmore, D.N. Rooted trees and iterated wreath products of cyclic groups. Adv. Appl. Math. 2004, 33, 531–547. [Google Scholar] [CrossRef] [Green Version]
  10. Im, M.S.; Wu, A. Generalized iterated wreath products of cyclic groups and rooted trees correspondence. Adv. Math. Sci. 2018, 15, 15–28. [Google Scholar]
  11. Im, M.S.; Wu, A. Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence. Adv. Math. Sci. 2018, 15, 29–46. [Google Scholar]
  12. Im, M.S.; Khovanov, M. Foams, iterated wreath products, field extensions and Sylvester sums. arXiv 2021, arXiv:2107.07845. [Google Scholar]
  13. Vershik, A.M.; Okounkov, A.Y. A new approach to representation theory of symmetric groups. II. Zap. Nauchn. Sem. St-Peterburg Otdel. Mat. Inst. Steklov. (POMI) 2004, 307, 57–98, 281. [Google Scholar] [CrossRef]
  14. Vershik, A.M. Gelfand-Tsetlin algebras, expectations, inverse limits, Fourier analysis. In The Unity of Mathematics; Birkhäuser Boston: Boston, MA, USA, 2006; Volume 244, pp. 619–631. [Google Scholar]
Figure 1. The embedding of A 1 i A 2 fixes the circled branch.
Figure 1. The embedding of A 1 i A 2 fixes the circled branch.
Mathematics 10 03761 g001
Figure 2. Images of A n , A ^ n and A ^ n + 1 represented in the tree diagram of T n + 2 .
Figure 2. Images of A n , A ^ n and A ^ n + 1 represented in the tree diagram of T n + 2 .
Mathematics 10 03761 g002
Figure 3. The algebra End 2 ( Ind 2 ) decomposes as End 2 ( Id ) D 2 , 4 . A generating set for D 2 , 4 is B ^ B ( 1 ) { o 2 ( β 3 ) , o 2 ( β 4 ) , o 2 ( β 4 β 3 ) } , where B ^ = { β ^ 1 , β ^ 2 } and B ( 1 ) = { β 1 ( 1 ) , β 2 ( 1 ) , β 3 ( 1 ) } .
Figure 3. The algebra End 2 ( Ind 2 ) decomposes as End 2 ( Id ) D 2 , 4 . A generating set for D 2 , 4 is B ^ B ( 1 ) { o 2 ( β 3 ) , o 2 ( β 4 ) , o 2 ( β 4 β 3 ) } , where B ^ = { β ^ 1 , β ^ 2 } and B ( 1 ) = { β 1 ( 1 ) , β 2 ( 1 ) , β 3 ( 1 ) } .
Mathematics 10 03761 g003
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Im, M.S.; Oğuz, C.O. Natural Transformations between Induction and Restriction on Iterated Wreath Product of Symmetric Group of Order 2. Mathematics 2022, 10, 3761. https://doi.org/10.3390/math10203761

AMA Style

Im MS, Oğuz CO. Natural Transformations between Induction and Restriction on Iterated Wreath Product of Symmetric Group of Order 2. Mathematics. 2022; 10(20):3761. https://doi.org/10.3390/math10203761

Chicago/Turabian Style

Im, Mee Seong, and Can Ozan Oğuz. 2022. "Natural Transformations between Induction and Restriction on Iterated Wreath Product of Symmetric Group of Order 2" Mathematics 10, no. 20: 3761. https://doi.org/10.3390/math10203761

APA Style

Im, M. S., & Oğuz, C. O. (2022). Natural Transformations between Induction and Restriction on Iterated Wreath Product of Symmetric Group of Order 2. Mathematics, 10(20), 3761. https://doi.org/10.3390/math10203761

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop