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
Class-sum products in the symmetric group: Combinatorial interpretation of the reduced class coefficients
β Scribed by Jacob Katriel
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 214 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0020-7608
No coin nor oath required. For personal study only.
β¦ Synopsis
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 terms of a set of reduced class coefficients n Ε½ . RCCs , the p-RCCs. The combinatorial significance of the p-RCCs is elucidated, showing that they are related to a well-defined enumeration problem within S , which has to do p with a certain refinement of the corresponding class multiplication problem. This is in contrast with the representation-theoretic evaluation of the p-RCCs, which requires the wΕ½ .x evaluation of products involving p for several values of n ) p. The combinatorial n interpretation of the p-RCCs allows the derivation of some of their previously conjectured properties and of some of the ''elimination rules'' that specific types of p-RCCs were found to satisfy.
π SIMILAR VOLUMES
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