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
Products of arbitrary class-sums in the symmetric group
β Scribed by Jacob Katriel
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 186 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0020-7608
No coin nor oath required. For personal study only.
β¦ Synopsis
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 appropriate number of fixed . points . Let the support size of a conjugacy class be the number of indices that are not fixed points. The algorithm proposed implies that the coefficient of the class-sum C in the product of the class-sums A and B is given in terms of a well-defined enumeration problem within the symmetric group S , where p is the smallest of the support sizes of p
π SIMILAR VOLUMES
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
An algorithm for the evaluation of matrix representations of products of permutation operators and of one-and two-electron spin-dependent operators in a spin-adapted basis of the N-electron spin space is presented. In particular, the case of the basis functions in which pΠ electrons are described by