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
Number of equivalence classes with respect to certain subgroups of a symmetric group
✍ Scribed by É. A. Primenko
- Publisher
- Springer US
- Year
- 1979
- Tongue
- English
- Weight
- 374 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We determine the number of blocks of the generalized Burnside ring of the symmetric group S with respect to the Young subgroups of S over a field of n n characteristic p. Let kS be a group algebra of S over a field k of characteristic n n Ž . p ) 0 and R R kS the Grothendieck ring of kS over p-local
Let ν G denote the number of conjugacy classes of non-normal subgroups of a group G We prove that if G is a finite group and ν G = 0 then there is a cyclic subgroup C of prime power order contained in the centre of G such that the order of G/C is a product of at most ν G + 1 primes. We also obtain a