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.
A matrix of combinatorial numbers related to the symmetric groups
β Scribed by Adalbert Kerber
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 440 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
A mar.rix T =z (tik) is introduced, the coefficients of which are defined by tik : = (~kl(w9L,,~" Ui(X)k, i,kEN={1,2,3,..
. , }, where a;(x) denotes the number of i cycles in the element x of the symmetric group S,,. It is shown that "lese numbers are natural numbers, that they are easy to evaluate, and that they serve very weIt An order to formulate an infinite number
π 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
We study the number of homomorphisms from a finite group to a general linear group over a finite field. In particular, we give a generating function of such numbers. Then the Rogers-Ramanujan identities are applicable.