We give a detailed account of Cherednik's fusion process for the symmetric group using as a key tool the combinatorics of compatible orders on the set of inversions of permutations.
Fischer Matrices for Generalised Symmetric Groups—A Combinatorial Approach
✍ Scribed by Mohammed Almestady; Alun O. Morris
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 208 KB
- Volume
- 168
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
✦ Synopsis
The main aim of this article is to give a combinatorial method for computing the Fischer matrices of the generalised symmetric group. It is shown that generalised Young tableaux and tabloids play a crucial role in the calculation of the Fischer matrices. In particular, a recursive method which is similar to the Murnaghan-Nakayama formula involved in the calculation of irreducible characters of the symmetric group is proved.
📜 SIMILAR VOLUMES
Combinatorial methods are employed to study the double cosets of the symmetric group S n with respect to Young subgroups H and K . The current paper develops a correspondence between these double cosets and certain lists of integers . This approach leads naturally to an algorithm for computing the n