No CrossRef data available.
Published online by Cambridge University Press: 20 November 2018
The generalized symmetric group S(n, m) consists of all permutations of mn symbols commutative with
Since each cycle Qi = (1i 2i … mi) is of order m, there are mn permutations within the n cycles, generating an invariant subgroup Q of order mn. Also, there are n! ways of permuting the cycles among themselves, by transformations
where i1, i2, …, in are the symbols 1, 2, …, n in some order [5, p. 39]. The permutations W* form a subgroup Sn* of order n!, isomorphic to the symmetric group Sn.