| 释义 |
cycle (permutations) A permutation f of a set S is a cycle if there are elements s1, s2,…, sn such that f(s1) = s2, f (s2) = s3, ,,, f (sn−1) = sn, f (sn) = s1 and f fixes all other elements. n is called the length of f and equals the order of f as an element of the symmetry group of S. The cycle f is denoted as (s1 s2… sn).
|