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
A Combinatorial Approach to the Double Cosets of the Symmetric Group with respect to Young Subgroups
โ Scribed by Andrew R. Jones
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 247 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
โฆ Synopsis
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 number of ( H , K )-double cosets of S n .
๐ SIMILAR VOLUMES
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.
We present a general recursive algorithm for the efficient construction of N-body wave functions that belong to a given irreducible representation (irrep) of the orthogonal group and are at the same time characterized by a well-defined permutational symmetry. The main idea is to construct independen
It is shown that if H, K are any finitely generated subgroups of a free group F and U is any cyclic subgroup of F, then any intersection Hg U l Kg U of double 1 2 ลฝ . cosets contains only a finite number of double cosets H l K gU, and an explicit upper bound for this number is given in terms of the
This paper is concerned with certain ways in which people adjust to deprivation. Capability egalitarians cite cases where people adjust to deprivation by adapting their preferences to discredit welfarist egalitarianism. I argue that this phenomenon is an example of a larger set of cases, where peopl
Given a polynomial solution of a differential equation, its m-ary decomposition, i.e. its decomposition as a sum of m polynomials P [j] (x) = k ฮฑ j,k x ฮป j,k containing only exponents ฮป j,k with ฮป j,k+1 -ฮป j,k = m, is considered. A general algorithm is proposed in order to build holonomic equations