OurBigBook About$ Donate
 Sign in Sign up

Cycle of a permutation (x,σx,…,σk−1x)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Permutation
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For a permutation σ of a finite set, the cycle containing x is its orbit under the iterates of σ. Its length k is the least positive integer with σkx=x; finiteness and invertibility guarantee such a return. Two cycles that meet are the same, because any iterate of a common point belongs to both. Thus the cycles partition the set. In cycle notation, the displayed cycle sends each listed element to the next and the last one back to x.

 Ancestors (5)

  1. Permutation
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (3)

  • Filling pair on a closed genus-two surface
  • Finite ring characteristic divides cardinality
  • Pólya enumeration theorem

 Synonyms (1)

  • codex/cycles-of-a-permutation

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook