2014
DOI: 10.1017/cbo9781107279087
|View full text |Cite
|
Sign up to set email alerts
|

Representation Theory and Harmonic Analysis of Wreath Products of Finite Groups

Abstract: This book presents an introduction to the representation theory of wreath products of finite groups and harmonic analysis on the corresponding homogeneous spaces. The reader will find a detailed description of the theory of induced representations and Clifford theory, focusing on a general formulation of the little group method. This provides essential tools for the determination of all irreducible representations of wreath products of finite groups. The exposition also includes a detailed harmonic analysis of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
47
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 36 publications
(48 citation statements)
references
References 47 publications
0
47
0
Order By: Relevance
“…It will be often convenient to draw the diagram λ instead of writing S λ . For instance we may write ⊕ instead of: S λ ⊕ S δ for partitions λ = [3] and δ = [2, 1].…”
Section: Representations Of the Symmetric Groupmentioning
confidence: 99%
See 2 more Smart Citations
“…It will be often convenient to draw the diagram λ instead of writing S λ . For instance we may write ⊕ instead of: S λ ⊕ S δ for partitions λ = [3] and δ = [2, 1].…”
Section: Representations Of the Symmetric Groupmentioning
confidence: 99%
“…The most classical case is where H = S n−1 viewed as the subgroup of all permutations that fix n. An important generalization is the Littlewood-Richardson rule which gives the answer for the case H = S k × S n−k .Let F and G be finite groups such that G acts on the left of a finite set X. We denote by F ≀ X G the wreath product of F and G. The representation theory of F ≀ X G is a well-studied subject (see [3] and [6, Chapter 4]) and the case G = S n with the natural action on {1, . .…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Note that thanks to the separability assumption, every vertex at level n has exactly d n+1 descendants at level n + 1. Such a tree is called spherically homogeneous rooted tree (see for example [1] and [5]), and it depends only on the sequence of the degrees (d 1 , d 2 , . .…”
Section: Introductionmentioning
confidence: 99%
“…This generalizes the case of the Johnson scheme [4] (corresponding to |X| = 1) and the nonbinary Johnson scheme [13] (corresponding to G = group of all permutations of X). For other examples of this framework see [2,3]. We consider the related problem of explicitly block diagonalizing the commutant A X (n) of the action of G ∼ S n on V (B X (n)).…”
Section: Introductionmentioning
confidence: 99%