Definition
A permutation of a set X, which is a bijective function, is called a cycle if the action on X of the subgroup generated by has exactly one orbit with more than a single element. This notion is most commonly used when X is a finite set; then of course the orbit S in question is also finite. Let be any element of S, and put for any . Since by assumption S has more than one element, ; if S is finite, there is a minimal number for which . Then, and is the permutation defined by
and for any element of . The elements not fixed by can be pictured as
- .
A cycle can be written using the compact cycle notation (there are no commas between elements in this notation, to avoid confusion with a k-tuple). The length of a cycle, is the number of elements of its orbit of non-fixed elements. A cycle of length k is also called a k-cycle.
Read more about this topic: Cycle (mathematics)
Famous quotes containing the word definition:
“... if, as women, we accept a philosophy of history that asserts that women are by definition assimilated into the male universal, that we can understand our past through a male lens—if we are unaware that women even have a history—we live our lives similarly unanchored, drifting in response to a veering wind of myth and bias.”
—Adrienne Rich (b. 1929)
“One definition of man is “an intelligence served by organs.””
—Ralph Waldo Emerson (1803–1882)
“The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.”
—William James (1842–1910)