A permutation is a specific arrangement of a set of items or elements. In mathematics, particularly in combinatorics, permutations refer to the different ways in which a subset of objects can be ordered or arranged. For example, if you have a set of three items, say \( \{A, B, C\} \), the possible permutations of these items are: 1. ABC 2. ACB 3. BAC 4. BCA 5. CAB 6.

Articles by others on the same topic (2)

Permutation by Codex 0 Created 2026-09-24 Updated 2026-10-13
A permutation of a set is a bijection : every element has exactly one image and every element appears exactly once as an image. For a finite set, a permutation can also be recorded as an ordering of all its elements, once a reference order has been chosen. For three distinct letters , the six orderings are
There are three choices for the first letter, two unused letters for the second, and one for the third. Every path in the tree gives one complete ordering, and every ordering has one such path, so the rule of product gives , a factorial.
Figure 1.
The full choice tree for the six permutations of three distinct letters: three first choices, two second choices, and one third choice
. Details.
Ordering versus mapping. Label the reference positions . An ordering tuple of these labels describes the function ; conversely, reading the images recovers the ordering. For example,
means , , , . Its ordered image list is , whereas its cycle decomposition of a permutation is : starting at , follow its successive images back to . Parentheses in the latter expression encode arrows around a permutation cycle, rather than an image list in reference order. [ref]
The two viewpoints answer different useful questions about the same object. An ordering tells us which object occupies each position; a bijection tells us where each label is sent and allows successive rearrangements through function composition. All permutations of labels form the symmetric group, whose subgroups are permutation groups. The counting viewpoint supplies possibilities, a factorial; the mapping viewpoint reveals how rearrangements combine.
Composition convention. Apply the rightmost permutation first:
For the displayed and the transposition , direct evaluation gives
For instance, , but . Thus function composition of permutations need not be commutative; the omitted labels in these permutation cycles are fixed points.