An algorithm for the evaluation of the structure constants in the class algebra of the symmetric group has recently been considered. The product of the class wΕ½ .x sum p that consists of a cycle of length p and n y p fixed points, with an arbitrary n class sum in S , was found to be expressible in t
Class-sum products in the symmetric group: Minimally-connected reduced class coefficients
β Scribed by J. Katriel
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 652 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
β¦ Synopsis
The class algebra of the symmetric group plays an important role in the study of systems of identical particles. Recent progress in an ongoing effort to develop an algorithm for the combinatorial evaluation of the corresponding structure constants is presented. A connection is established with a closed form expression for a certain act of structure constants, obtained by Goupil and Bbdard, and by Goulden and Jackson. This allows the evaluation of a corresponding act of reduced coefficients that, in turn, have considerably wider applicability. Some outstanding open problems are presented.
π SIMILAR VOLUMES
An algorithm for the evaluation of products of arbitrary conjugacy class-sums in the symmetric group is conjectured. This algorithm generalizes a procedure presented sometime ago, which deals with products in which at least one of the Ε½ class-sums involved consists of a single cycle and an appropria
Progress in the formulation of a procedure for the combinatorial evaluation of the product of a single-cycle and an arbitrary class sum in the symmetric group algebra is presented. The procedure consists of a ''global conjecture'' concerning wΕ½ .x w x the representation of the product p ΠΈ ) in terms
The shape of a Young diagram Y (I Y[ = n) can be specified in terms of the set of symmetric power sums over its contents, at = ~(i,j)~r(/"-i)t; ~ = 1,2 .... , n. It is remarkable that the set of power sums try, a2 .... , ak is sufficient to characterize the Young diagrams possessing up to n(k) boxes