Permutation

In mathematics, a permutation of a set can mean one of two different things:

• an arrangement of its members in a sequence or linear order, or
• the act or process of changing the linear order of an ordered set.^[1]

An example of the first meaning, is the six permutations (orderings) of the set {1, 2, 3}: written as tuples, they are (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). Anagrams of a word whose letters are all different are also permutations: the letters are already ordered in the original word, and the anagram reorders them. The study of permutations of finite sets is an important topic in combinatorics and group theory.

Permutations are used in almost every branch of mathematics and in many other fields of science. In computer science, they are used for analyzing sorting algorithms; in quantum physics, for describing states of particles; and in biology, for describing RNA sequences.

The number of permutations of n distinct objects is n factorial, usually written as n!, which means the product of all positive integers less than or equal to n.

According to the second meaning, a permutation of a set S is defined as a bijection from S to itself.^[2][3] That is, it is a function from S to S for which every element occurs exactly once as an image value. Such a function ${\displaystyle \sigma :S\to S}$ is equivalent to the rearrangement of the elements of S in which each element i is replaced by the corresponding ${\displaystyle \sigma (i)}$. For example, the permutation (3, 1, 2) is described by the function ${\displaystyle \sigma }$ defined as

${\displaystyle \sigma (1)=3,\quad \sigma (2)=1,\quad \sigma (3)=2}$.

The collection of all permutations of a set form a group called the symmetric group of the set. The group operation is the composition of functions (performing one rearrangement after the other), which results in another function (rearrangement). The properties of permutations do not depend on the nature of the elements being permuted, only on their number, so one often considers the standard set ${\displaystyle S=\{1,2,\ldots ,n\}}$.

In elementary combinatorics, the k-permutations, or partial permutations, are the ordered arrangements of k distinct elements selected from a set. When k is equal to the size of the set, these are the permutations in the previous sense.