Cookies help us deliver our services. By using our services, you agree to our use of cookies.

# permutation

## definition : permutation

In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting. These differ from combinations, which are selections of some members of a set where order is disregarded. For example, written as tuples, there are six permutations of the set {1,2,3}, namely: (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1). These are all the possible orderings of this three element set. As another example, an anagram of a word, all of whose letters are different, is a permutation of its letters. In this example, the letters are already ordered in the original word and the anagram is a reordering of the letters. The study of permutations of finite sets is a topic in the field of combinatorics.

Permutations occur, in more or less prominent ways, in almost every area of mathematics. They often arise when different orderings on certain finite sets are considered, possibly only because one wants to ignore such orderings and needs to know how many configurations are thus identified. For similar reasons permutations arise in the study of sorting algorithms in computer science.

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

In algebra and particularly in group theory, a permutation of a set is defined as a bijection from to itself. That is, it is a function from to for which every element occurs exactly once as an image value. This is related to the rearrangement of the elements of in which each element is replaced by the corresponding . The collection of such permutations form a group called the symmetric group of . The key to this group's structure is the fact that the composition of two permutations (performing two given rearrangements in succession) results in another rearrangement. Permutations may act on structured objects by rearranging their components, or by certain replacements (substitutions) of symbols.

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

==History==

The rule to determine the number of permutations of n objects was known in Indian culture at least as early as around 1150: the Lilavati by the Indian mathematician Bhaskara II contains a passage that translates to

The product of multiplication of the arithmetical series beginning and increasing by unity and continued to the number of places, will be the variations of number with specific figures.

Fabian Stedman in 1677 described factorials when explaining the number of permutations of bells in change ringing. Starting from two bells: "first, two must be admitted to be varied in two ways" which he illustrates by showing 1 2 and 2 1. He then explains that with three bells there are "three times two figures to be produced out of three" which again is illustrated. His explanation involves "cast away 3, and 1.2 will remain; cast away 2, and 1.3 will remain; cast away 1, and 2.3 will remain". He then moves on to four bells and repeats the casting away argument showing that there will be four different sets of three. Effectively this is a recursive process. He continues with five bells using the "casting away" method and tabulates the resulting 120 combinations. At this point he gives up and remarks:

Now the nature of these methods is such, that the changes on one number comprehends the changes on all lesser numbers, ... insomuch that a compleat Peal of changes on one number seemeth to be formed by uniting of the compleat Peals on all lesser numbers into one entire body;
Stedman widens the consideration of permutations; he goes on to consider the number of permutations of the letters of the alphabet and horses from a stable of 20.

A first case in which seemingly unrelated mathematical questions were studied with the help of permutations occurred around 1770, when Joseph Louis Lagrange, in the study of polynomial equations, observed that properties of the permutations of the roots of an equation are related to the possibilities to solve it. This line of work ultimately resulted, through the work of Évariste Galois, in Galois theory, which gives a complete description of what is possible and impossible with respect to solving polynomial equations (in one unknown) by radicals. In modern mathematics there are many similar situations in which understanding a problem requires studying certain permutations related to it.

==Definition and notations==

There are two equivalent common ways of regarding permutations, sometimes called the active and passive forms, or in older terminology substitutions and permutations. Which form is preferable depends on the type of questions being asked in a given discipline.

The active way to regard permutations of a set S (finite or infinite) is to define them as the bijections from S to itself. Thus, the permutations are thought of as functions which can be composed with each other, forming groups of permutations. From this viewpoint, the elements of S have no internal structure and are just labels for the objects being moved: one may refer to permutations of any set of n elements as "permutations on n letters".

In Cauchy's two-line notation, one lists the elements of S in the first row, and for each one its image below it in the second row. For instance, a particular permutation of the set S = {1,2,3,4,5} can be written as: : $\sigma = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 2 & 5 & 4 & 3 & 1 \end\left\{pmatrix\right\};$ this means that σ satisfies , , , , and . The elements of S may appear in any order in the first row. This permutation could also be written as: : $\sigma = \begin\left\{pmatrix\right\} 3 & 2 & 5 & 1 & 4 \\ 4 & 5 & 1 & 2 & 3 \end\left\{pmatrix\right\}.$

The passive way to regard a permutation of the set S is an ordered arrangement (or listing, or linearly ordered arrangement, or sequence without repetition) of the elements of S. This is related to the active form as follows. If there is a "natural" order for the elements of S, say $x_1, x_2, \ldots, x_n$, then one uses this for the first row of the two-line notation: : $\sigma = \begin\left\{pmatrix\right\} x_1 & x_2 & x_3 & \cdots & x_n \\ \sigma\left(x_1\right) & \sigma\left(x_2\right) & \sigma\left(x_3\right) & \cdots & \sigma\left(x_n\right) \end\left\{pmatrix\right\}.$

Under this assumption, one may omit the first row and write the permutation in one-line notation as $\sigma\left(x_1\right) \; \sigma\left(x_2\right) \; \sigma\left(x_3\right) \; \cdots \; \sigma\left(x_n\right)$, that is, an ordered arrangement of S. Care must be taken to distinguish one-line notation from the cycle notation described later. In mathematics literature, a common usage is to omit parentheses for one-line notation, while using them for cycle notation. The one-line notation is also called the word representation of a permutation.) These objects are also known as partial permutations or as sequences without repetition, terms that avoid confusion with the other, more common, meaning of "permutation". The number of such $k$-permutations of $n$ is denoted variously by such symbols as $P^n_k$, $_nP_k$, $^nP_k$, $P_\left\{n,k\right\}$, or $P\left(n,k\right)$, and its value is given by the product

: $P\left(n,k\right) = \underbrace\left\{n\cdot\left(n-1\right)\cdot\left(n-2\right)\cdots\left(n-k+1\right)\right\}_\left\{k\ \mathrm\left\{factors\right\}\right\}$, which is 0 when , and otherwise is equal to : $\frac\left\{n!\right\}\left\{\left(n-k\right)!\right\}.$

The product is well defined without the assumption that $n$ is a non-negative integer and is of importance outside combinatorics as well; it is known as the Pochhammer symbol $\left(n\right)_k$ or as the $k$-th falling factorial power $n^\left\{\underline k\right\}$ of $n$.

This usage of the term permutation is closely related to the term combination. A k-element combination of an n-set S is a k element subset of S, the elements of which are not ordered. By taking all the k element subsets of S and ordering each of them in all possible ways we obtain all the k-permutations of S. The number of k-combinations of an n-set, C(n,k), is therefore related to the number of k-permutations of n by: : $C\left(n,k\right) = \frac\left\{P\left(n,k\right)\right\}\left\{P\left(k,k\right)\right\} = \frac\left\{\tfrac\left\{n!\right\}\left\{\left(n-k\right)!\right\}\right\}\left\{\tfrac\left\{k!\right\}\left\{0!\right\}\right\} = \frac\left\{n!\right\}\left\{\left(n-k\right)!\,k!\right\}.$

These numbers are also known as binomial coefficients and denoted $\binom\left\{n\right\}\left\{k\right\}$.

===Permutations with repetition=== Ordered arrangements of the elements of a set S of length n where repetition is allowed are called n-tuples, but have sometimes been referred to as permutations with repetition although they are not permutations in general. They are also called words over the alphabet S in some contexts. If the set S has k elements, the number of n-tuples over S is: :$k^n.$ There is no restriction on how often an element can appear in an n-tuple, but if restrictions are placed on how often an element can appear, this formula is no longer valid.

===Permutations of multisets===

If M is a finite multiset, then a multiset permutation is an ordered arrangement of elements of M in which each element appears exactly as often as is its multiplicity in M. An anagram of a word having some repeated letters is an example of a multiset permutation. If the multiplicities of the elements of M (taken in some order) are $m_1$, $m_2$, …, $m_l$ and their sum (i.e., the size of M) is n, then the number of multiset permutations of M is given by the multinomial coefficient, :$\left\{n \choose m_1, m_2, \ldots, m_l\right\} = \frac\left\{n!\right\}\left\{m_1!\, m_2!\, \cdots\, m_l!\right\}.$

For example, the number of distinct anagrams of the word MISSISSIPPI is: :$\frac\left\{11!\right\}\left\{1!\, 4!\, 4!\, 2!\right\} = 34650$.

A k-permutation of a multiset M is a sequence of length k of elements of M in which each element appears at most its multiplicity in M times (an element's repetition number).

===Circular permutations===

Permutations, when considered as arrangements, are sometimes referred to as linearly ordered arrangements. In these arrangements there is a first element, a second element, and so on. If, however, the objects are arranged in a circular manner this distinguished ordering no longer exists, that is, there is no "first element" in the arrangement, any element can be considered as the start of the arrangement. The arrangements of objects in a circular manner are called circular permutations. These can be formally defined as equivalence classes of ordinary permutations of the objects, for the equivalence relation generated by moving the final element of the linear arrangement to its front.

Two circular permutations are equivalent if one can be rotated into the other (that is, cycled without changing the relative positions of the elements). The following two circular permutations on four letters are considered to be the same.

1 4 4 3 2 1 2 3

The circular arrangements are to be read counterclockwise, so the following two are not equivalent since no rotation can bring one to the other.

1 1 4 3 3 4 2 2

The number of circular permutations of a set S with n elements is (n - 1)!.

==Permutations in group theory==

The set of all permutations of any given set S forms a group, with the composition of maps as the product operation and the identity function as the neutral element of the group. This is the symmetric group of S, denoted by Sym(S). Up to isomorphism, this symmetric group only depends on the cardinality of the set (called the degree of the group), so the nature of elements of S is irrelevant for the structure of the group. Symmetric groups have been studied mostly in the case of finite sets, so, confined to this case, one can assume without loss of generality that S = {1,2,...,n} for some natural number n. This is then the symmetric group of degree n, usually written as .

Any subgroup of a symmetric group is called a permutation group. By Cayley's theorem any group is isomorphic to some permutation group, and every finite group to a subgroup of some finite symmetric group.

===Cycle notation===

This alternative notation describes the effect of repeatedly applying the permutation, thought of as a function from a set onto itself. It expresses the permutation as a product of cycles corresponding to the orbits of the permutation; since distinct orbits are disjoint, this is referred to as "decomposition into disjoint cycles".

Starting from some element x of S, one writes the sequence (x σ(x) σ(σ(x)) ...) of successive images under σ, until the image returns to x, at which point one closes the parenthesis rather than repeat x. The set of values written down forms the orbit (under σ) of x, and the parenthesized expression gives the corresponding cycle of σ. One then continues by choosing a new element y of S outside the previous orbits and writing down the cycle starting at y; and so on until all elements of S are written in cycles. Since for every new cycle the starting point can be chosen in different ways, there are in general many different cycle notations for the same permutation; for the example above one has:

:$\begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 2 & 5 & 4 & 3 & 1\end\left\{pmatrix\right\}=\begin\left\{pmatrix\right\}1 & 2 & 5 \end\left\{pmatrix\right\} \begin\left\{pmatrix\right\}3 & 4 \end\left\{pmatrix\right\} = \begin\left\{pmatrix\right\}3 & 4 \end\left\{pmatrix\right\} \begin\left\{pmatrix\right\}1 & 2 & 5 \end\left\{pmatrix\right\} = \begin\left\{pmatrix\right\}3 & 4 \end\left\{pmatrix\right\} \begin\left\{pmatrix\right\}5 & 1 & 2 \end\left\{pmatrix\right\}.$

A cycle (x) of length 1 occurs when σ(x) = x, and is commonly omitted from the cycle notation, provided the set S is clear: for any element xS not appearing in a cycle, one implicitly assumes σ(x) = x. The identity permutation, which consists only of 1-cycles, can be denoted by a single 1-cycle (x), by the number 1, or by id.

A cycle (x1 x2 ... xk) of length k is called a k-cycle. Written by itself, it denotes a permutation in its own right, which maps xi to xi+1 for , and xk to x1, while implicitly mapping all other elements of S to themselves (omitted 1-cycles). Therefore, the individual cycles in the cycle notation can be interpreted as factors in a composition product. Since the orbits are disjoint, the corresponding cycles commute under composition, and so can be written in any order. The cycle decomposition is essentially unique: apart from the reordering the cycles in the product, there are no other ways to write σ as a product of cycles. Each individual cycle can be written in different ways, as in the example above where (5 1 2) and (1 2 5) and (2 5 1) all denote the same cycle, though note that (5 2 1) denotes a different cycle.

An element in a 1-cycle (x), corresponding to σ(x) = x, is called a fixed point of the permutation σ. A permutation with no fixed points is called a derangement. Cycles of length two are called transpositions; such permutations merely exchange the place of two elements, implicitly leaving the others fixed. Since the orbits of a permutation partition the set S, for a finite set of size n, the lengths of the cycles of a permutation σ form a partition of n called the cycle type of σ. There is a "1" in the cycle type for every fixed point of σ, a "2" for every transposition, and so on. The cycle type of β = (1 2 5)(3 4)(6 8)(7), is (3,2,2,1) which is sometimes written in a more compact form as (11,22,31).

The number of n-permutations with k disjoint cycles is the signless Stirling number of the first kind, denoted by $c\left(n, k\right)$.

=== Abstract groups vs. permutations vs. group actions ===

Permutation groups have more structure than abstract groups, and different realizations of a group as a permutation group need not be equivalent as permutations. For instance is naturally a permutation group, in which any transposition has cycle type (2,1); but the proof of Cayley's theorem realizes as a subgroup of (namely the permutations of the 6 elements of itself), in which permutation group transpositions have cycle type (2,2,2). Finding the minimal-order symmetric group containing a subgroup isomorphic to a given group (sometimes called minimal faithful degree representation) is a rather difficult problem. So in spite of Cayley's theorem, the study of permutation groups differs from the study of abstract groups, being a branch of representation theory.

Much of the power of permutations can be regained in an abstract setting by considering group actions instead. A group action actually permutes the elements of a set according to the recipe provided by the abstract group. For example, acts faithfully and transitively on a set with exactly three elements (by permuting them).

===Product and inverse===

The product of two permutations is defined as their composition as functions, in other words σ·π is the function that maps any element x of the set to σ(π(x)). Note that the rightmost permutation is applied to the argument first, because of the way function application is written. Some authors prefer the leftmost factor acting first, but to that end permutations must be written to the right of their argument, for instance as an exponent, where σ acting on x is written xσ; then the product is defined by . However this gives a different rule for multiplying permutations; this article uses the definition where the rightmost permutation is applied first.

Since the composition of two bijections always gives another bijection, the product of two permutations is again a permutation. In two-line notation, the product of two permutations is obtained by rearranging the columns of the second (leftmost) permutation so that its first row is identical with the second row of the first (rightmost) permutation. The product can then be written as the first row of the first permutation over the second row of the modified second permutation. For example, given the permutations, :$P = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\2 & 4 & 1 & 3 & 5 \end\left\{pmatrix\right\}\quad \text\left\{ and \right\} \quad Q = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 5 & 4 & 3 & 2 & 1 \end\left\{pmatrix\right\},$

the product QP is: :$QP = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 5 & 4 & 3 & 2 & 1 \end\left\{pmatrix\right\}\begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 2 & 4 & 1 & 3 & 5 \end\left\{pmatrix\right\} = \begin\left\{pmatrix\right\} 2 & 4 & 1 & 3 & 5 \\ 4 & 2 & 5 & 3 & 1 \end\left\{pmatrix\right\} \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 2 & 4 & 1 & 3 & 5 \end\left\{pmatrix\right\} = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 4 & 2 & 5 & 3 & 1 \end\left\{pmatrix\right\}.$

In cycle notation this same product would be given by: :$Q \cdot P = \left(1 5\right)\left(2 4\right) \cdot \left(1 2 4 3\right) = \left(1 4 3 5\right).$

In general the composition of two permutations is not commutative, so that PQ can be different from QP as in the above example: :$PQ = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 2 & 4 & 1 & 3 & 5 \end\left\{pmatrix\right\}\begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 5 & 4 & 3 & 2 & 1 \end\left\{pmatrix\right\} = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 5 & 3 & 1 & 4 & 2 \end\left\{pmatrix\right\} \neq QP.$

Since function composition is associative, so is the product operation on permutations: . Therefore, products of more than two permutations are usually written without adding parentheses to express grouping; they are also usually written without a dot or other sign to indicate multiplication.

The identity permutation, which maps every element of the set to itself, is the neutral element for this product. In two-line notation, the identity is :$\begin\left\{pmatrix\right\} 1 & 2 & 3 & \cdots & n \\ 1 & 2 & 3 & \cdots & n \end\left\{pmatrix\right\}.$

Since bijections have inverses, so do permutations, and the inverse σ−1 of σ is again a permutation. Explicitly, whenever one also has . In two-line notation the inverse can be obtained by interchanging the two lines (and sorting the columns if one wishes the first line to be in a given order). For instance :$\begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 2 & 5 & 4 & 3 & 1 \end\left\{pmatrix\right\}^\left\{-1\right\} = \begin\left\{pmatrix\right\} 2 & 5 & 4 & 3 & 1 \\ 1 & 2 & 3 & 4 & 5 \end\left\{pmatrix\right\} = \begin\left\{pmatrix\right\} 1 & 2 & 3 & 4 & 5 \\ 5 & 1 & 4 & 3 & 2 \end\left\{pmatrix\right\}.$

In cycle notation one can reverse the order of the elements in each cycle to obtain a cycle notation for its inverse. Thus, :$\left[\left(1 2 5\right)\left(3 4\right)\right]^\left\{-1\right\} = \left(5 2 1\right)\left(4 3\right) = \left(1 5 2\right)\left(3 4\right).$

Having an associative product, a neutral element, and inverses for all its elements, makes the set of all permutations of S into a group, called the symmetric group of S.

===Properties=== Every permutation of a finite set can be expressed as the product of transpositions. Moreover, although many such expressions for a given permutation may exist, there can never be among them both expressions with an even number and expressions with an odd number of transpositions. All permutations are then classified as even or odd, according to the parity of the number of transpositions in any such expression.

Multiplying permutations written in cycle notation follows no easily described pattern, and the cycles of the product can be entirely different from those of the permutations being composed. However the cycle structure is preserved in the special case of conjugating a permutation σ by another permutation π, which means forming the product π·σ·π−1. Here the cycle notation of the result can be obtained by taking the cycle notation for σ and applying π to all the entries in it.

====Matrix representation==== One can represent a permutation of {1, 2, ..., n} as an n×n matrix. There are two natural ways to do so, but only one for which multiplications of matrices corresponds to multiplication of permutations in the same order: this is the one that associates to σ the matrix M whose entry Mi,j is 1 if i = σ(j), and 0 otherwise. The resulting matrix has exactly one entry 1 in each column and in each row, and is called a permutation matrix.
[http://upload.wikimedia.org/wikipedia/commons/thumb/6/6d/Symmetric_group_4%3B_permutation_list_with_matrices.svg/1000px-Symmetric_group_4%3B_permutation_list_with_matrices.svg.png Here] (file) is a list of these matrices for permutations of 4 elements. The Cayley table on the right shows these matrices for permutations of 3 elements.

====Permutation of components of a sequence==== As with any group, one can consider actions of a symmetric group on a set, and there are many ways in which such an action can be defined. For the symmetric group of {1, 2, ..., n} there is one particularly natural action, namely the action by permutation on the set Xn of sequences of n symbols taken from some set X. As with the matrix representation, there are two natural ways in which the result of permuting a sequence (x1,x2,...,xn) by σ can be defined, but only one is compatible with the multiplication of permutations (so as to give a left action of the symmetric group on Xn); with the multiplication rule used in this article this is the one given by :$\sigma\cdot\left(x_1,\ldots,x_n\right) = \left(x_\left\{\sigma^\left\{-1\right\}\left(1\right)\right\},\ldots,x_\left\{\sigma^\left\{-1\right\}\left(n\right)\right\}\right).$ This means that each component xi ends up at position σ(i) in the sequence permuted by σ.

==Permutations of totally ordered sets==

In some applications, the elements of the set being permuted will be compared with each other. This requires that the set S has a total order so that any two elements can be compared. The set {1, 2, ..., n} is totally ordered by the usual "≤" relation and so it is the most frequently used set in these applications, but in general, any totally ordered set will do. In these applications, the ordered arrangement view of a permutation is needed to talk about the positions in a permutation.

Here are a number of properties that are directly related to the total ordering of S.

===Ascents, descents, runs and excedances===

An ascent of a permutation σ of n is any position i < n where the following value is bigger than the current one. That is, if σ = σ1σ2...σn, then i is an ascent if σi < σi+1.

For example, the permutation 3452167 has ascents (at positions) 1, 2, 5, and 6.

Similarly, a descent is a position i < n with σi > σi+1, so every i with σ.

An ascending run of a permutation is a nonempty increasing contiguous subsequence of the permutation that cannot be extended at either end; it corresponds to a maximal sequence of successive ascents (the latter may be empty: between two successive descents there is still an ascending run of length 1). By contrast an increasing subsequence of a permutation is not necessarily contiguous: it is an increasing sequence of elements obtained from the permutation by omitting the values at some positions. For example, the permutation 2453167 has the ascending runs 245, 3, and 167, while it has an increasing subsequence 2367.

If a permutation has k − 1 descents, then it must be the union of k ascending runs.

The number of permutations of n with k ascents is (by definition) the Eulerian number $\textstyle\left\langle\left\{n\atop k\right\}\right\rangle$; this is also the number of permutations of n with k descents. Some authors however define the Eulerian number $\textstyle\left\langle\left\{n\atop k\right\}\right\rangle$ as the number of permutations with k ascending runs, which corresponds to descents.

An excedance of a permutation σ1σ2σn in an index j such that . If the inequality is not strict (i.e., ), then j is called a weak excedance. The number of n-permutations with k excedances coincides with the number of n-permutations with k descents.

=== Canonical cycle notation ( standard form) === In some combinatorial contexts it useful to fix a certain order or the elements in the cycles and of the (disjoint) cycles themselves. Miklós Bóna calls the following ordering choices the canonical cycle notation: * in each cycle the largest element is listed first * the cycles are sorted in increasing order of their first element

For example, (312)(54)(8)(976) is a permutation in canonical cycle notation. Note that the canonical cycle notation does not omit one-cycles.

Richard P. Stanley calls the same choice of representation the "standard representation" of a permutation. and Martin Aigner uses the term "standard form" for the same notion. Sergey Kitaev also uses the "standard form" terminology, but reverses both choices; i.e., each cycle lists its least element first and the cycles are sorted in decreasing order of their least/first elements. In the remainder of this article, we use the first of these dual forms as the standard/canonical one.

=== Foata's transition lemma (or the fundamental bijection) === A natural question arises as to the relationship of the one-line and the canonical cycle notation. For example, considering the permutation (2)(31), which is in canonical cycle notation, if we erase its cycle parentheses, we obtain a different permutation in one-line notation, namely 231. (The permutation (2)(31) is actually 321 in one-line notation.) Foata's transition lemma establishes the nature of this correspondence as a bijection on the set of n-permutations (to itself). Richard P. Stanley calls this correspondence the fundamental bijection. So a descent is just an inversion at two adjacent positions. For example, the permutation has three inversions: (1,3), (2,3), (4,5), for the pairs of entries (2,1), (3,1), (5,4).

Sometimes an inversion is defined as the pair of values itself whose order is reversed; this makes no difference for the number of inversions, and this pair (reversed) is also an inversion in the above sense for the inverse permutation σ−1. The number of inversions is an important measure for the degree to which the entries of a permutation are out of order; it is the same for σ and for σ−1. To bring a permutation with k inversions into order (i.e., transform it into the identity permutation), by successively applying (right-multiplication by) adjacent transpositions, is always possible and requires a sequence of k such operations. Moreover, any reasonable choice for the adjacent transpositions will work: it suffices to choose at each step a transposition of i and where i is a descent of the permutation as modified so far (so that the transposition will remove this particular descent, although it might create other descents). This is so because applying such a transposition reduces the number of inversions by 1; also note that as long as this number is not zero, the permutation is not the identity, so it has at least one descent. Bubble sort and insertion sort can be interpreted as particular instances of this procedure to put a sequence into order. Incidentally this procedure proves that any permutation σ can be written as a product of adjacent transpositions; for this one may simply reverse any sequence of such transpositions that transforms σ into the identity. In fact, by enumerating all sequences of adjacent transpositions that would transform σ into the identity, one obtains (after reversal) a complete list of all expressions of minimal length writing σ as a product of adjacent transpositions.

The number of permutations of n with k inversions is expressed by a Mahonian number, it is the coefficient of Xk in the expansion of the product :$\prod_\left\{m=1\right\}^n\sum_\left\{i=0\right\}^\left\{m-1\right\}X^i = 1 \left\left(1 + X\right\right)\left\left(1 + X + X^2\right\right) \cdots \left\left(1 + X + X^2 + \cdots + X^\left\{n-1\right\}\right\right),$

which is also known (with q substituted for X) as the q-factorial [n]q! . The expansion of the product appears in Necklace (combinatorics).

==Permutations in computing==

===Numbering permutations===

One way to represent permutations of n is by an integer N with 0 ≤ N < n!, provided convenient methods are given to convert between the number and the representation of a permutation as an ordered arrangement (sequence). This gives the most compact representation of arbitrary permutations, and in computing is particularly attractive when n is small enough that N can be held in a machine word; for 32-bit words this means n ≤ 12, and for 64-bit words this means n ≤ 20. The conversion can be done via the intermediate form of a sequence of numbers dn, dn−1, …, d2, d1, where di is a non-negative integer less than i (one may omit d1, as it is always 0, but its presence makes the subsequent conversion to a permutation easier to describe). The first step then is to simply express N in the factorial number system, which is just a particular mixed radix representation, where for numbers up to n! the bases for successive digits are n, , …, 2, 1. The second step interprets this sequence as a Lehmer code or (almost equivalently) as an inversion table.

In the Lehmer code for a permutation σ, the number dn represents the choice made for the first term σ1, the number dn−1 represents the choice made for the second term σ2 among the remaining elements of the set, and so forth. More precisely, each dn+1−i gives the number of remaining elements strictly less than the term σi. Since those remaining elements are bound to turn up as some later term σj, the digit dn+1−i counts the inversions (i,j) involving i as smaller index (the number of values j for which i < j and σi > σj). The inversion table for σ is quite similar, but here dn+1−k counts the number of inversions (i,j) where k = σj occurs as the smaller of the two values appearing in inverted order. Both encodings can be visualized by an n by n Rothe diagram (named after Heinrich August Rothe) in which dots at (i,σi) mark the entries of the permutation, and a cross at (i,σj) marks the inversion (i,j); by the definition of inversions a cross appears in any square that comes both before the dot (j,σj) in its column, and before the dot (i,σi) in its row. The Lehmer code lists the numbers of crosses in successive rows, while the inversion table lists the numbers of crosses in successive columns; it is just the Lehmer code for the inverse permutation, and vice versa.

To effectively convert a Lehmer code dn, dn−1, ..., d2, d1 into a permutation of an ordered set S, one can start with a list of the elements of S in increasing order, and for i increasing from 1 to n set σi to the element in the list that is preceded by dn+1−i other ones, and remove that element from the list. To convert an inversion table dn, dn−1, ..., d2, d1 into the corresponding permutation, one can traverse the numbers from d1 to dn while inserting the elements of S from largest to smallest into an initially empty sequence; at the step using the number d from the inversion table, the element from S inserted into the sequence at the point where it is preceded by d elements already present. Alternatively one could process the numbers from the inversion table and the elements of S both in the opposite order, starting with a row of n empty slots, and at each step place the element from S into the empty slot that is preceded by d other empty slots.

Converting successive natural numbers to the factorial number system produces those sequences in lexicographic order (as is the case with any mixed radix number system), and further converting them to permutations preserves the lexicographic ordering, provided the Lehmer code interpretation is used (using inversion tables, one gets a different ordering, where one starts by comparing permutations by the place of their entries 1 rather than by the value of their first entries). The sum of the numbers in the factorial number system representation gives the number of inversions of the permutation, and the parity of that sum gives the signature of the permutation. Moreover, the positions of the zeroes in the inversion table give the values of left-to-right maxima of the permutation (in the example 6, 8, 9) while the positions of the zeroes in the Lehmer code are the positions of the right-to-left minima (in the example positions the 4, 8, 9 of the values 1, 2, 5); this allows computing the distribution of such extrema among all permutations. A permutation with Lehmer code dn, dn−1, ..., d2, d1 has an ascent if and only if .

===Algorithms to generate permutations===

In computing it may be required to generate permutations of a given sequence of values. The methods best adapted to do this depend on whether one wants some randomly chosen permutations, or all permutations, and in the latter case if a specific ordering is required. Another question is whether possible equality among entries in the given sequence is to be taken into account; if so, one should only generate distinct multiset permutations of the sequence.

An obvious way to generate permutations of n is to generate values for the Lehmer code (possibly using the factorial number system representation of integers up to n!), and convert those into the corresponding permutations. However, the latter step, while straightforward, is hard to implement efficiently, because it requires n operations each of selection from a sequence and deletion from it, at an arbitrary position; of the obvious representations of the sequence as an array or a linked list, both require (for different reasons) about n2/4 operations to perform the conversion. With n likely to be rather small (especially if generation of all permutations is needed) that is not too much of a problem, but it turns out that both for random and for systematic generation there are simple alternatives that do considerably better. For this reason it does not seem useful, although certainly possible, to employ a special data structure that would allow performing the conversion from Lehmer code to permutation in O(n log n) time.

====Random generation of permutations====

For generating random permutations of a given sequence of n values, it makes no difference whether one applies a randomly selected permutation of n to the sequence, or chooses a random element from the set of distinct (multiset) permutations of the sequence. This is because, even though in case of repeated values there can be many distinct permutations of n that result in the same permuted sequence, the number of such permutations is the same for each possible result. Unlike for systematic generation, which becomes unfeasible for large n due to the growth of the number n!, there is no reason to assume that n will be small for random generation.

The basic idea to generate a random permutation is to generate at random one of the n! sequences of integers d1,d2,...,dn satisfying (since d1 is always zero it may be omitted) and to convert it to a permutation through a bijective correspondence. For the latter correspondence one could interpret the (reverse) sequence as a Lehmer code, and this gives a generation method first published in 1938 by Ronald Fisher and Frank Yates. While at the time computer implementation was not an issue, this method suffers from the difficulty sketched above to convert from Lehmer code to permutation efficiently. This can be remedied by using a different bijective correspondence: after using di to select an element among i remaining elements of the sequence (for decreasing values of i), rather than removing the element and compacting the sequence by shifting down further elements one place, one swaps the element with the final remaining element. Thus the elements remaining for selection form a consecutive range at each point in time, even though they may not occur in the same order as they did in the original sequence. The mapping from sequence of integers to permutations is somewhat complicated, but it can be seen to produce each permutation in exactly one way, by an immediate induction. When the selected element happens to be the final remaining element, the swap operation can be omitted. This does not occur sufficiently often to warrant testing for the condition, but the final element must be included among the candidates of the selection, to guarantee that all permutations can be generated.

The resulting algorithm for generating a random permutation of a[0], a[1], ..., a[n − 1] can be described as follows in pseudocode:

for i from n downto 2 do   di ← random element of { 0, ..., i − 1 } swap a[di] and a[i − 1]

This can be combined with the initialization of the array a[i] = i as follows

for i from 0 to n−1 do   di+1 ← random element of { 0, ..., i } a[i] ← a[di+1] a[di+1] ← i

If di+1 = i, the first assignment will copy an uninitialized value, but the second will overwrite it with the correct value i.

====Generation in lexicographic order====

There are many ways to systematically generate all permutations of a given sequence. One classical algorithm, which is both simple and flexible, is based on finding the next permutation in lexicographic ordering, if it exists. It can handle repeated values, for which case it generates the distinct multiset permutations each once. Even for ordinary permutations it is significantly more efficient than generating values for the Lehmer code in lexicographic order (possibly using the factorial number system) and converting those to permutations. To use it, one starts by sorting the sequence in (weakly) increasing order (which gives its lexicographically minimal permutation), and then repeats advancing to the next permutation as long as one is found. The method goes back to Narayana Pandita in 14th century India, and has been frequently rediscovered ever since.

The following algorithm generates the next permutation lexicographically after a given permutation. It changes the given permutation in-place.

# Find the largest index k such that . If no such index exists, the permutation is the last permutation. # Find the largest index l greater than k such that . # Swap the value of a[k] with that of a[l]. # Reverse the sequence from a[k + 1] up to and including the final element a[n]. For example, given the sequence [1, 2, 3, 4] (which is in increasing order), and given that the index is zero-based, the steps are as follows: # Index k = 2, because 3 is placed at an index that satisfies condition of being the largest index that is still less than a[k + 1] which is 4. # Index l = 3, because 4 is the only value in the sequence that is greater than 3 in order to satisfy the condition a[k] < a[l]. # The values of a[2] and a[3] are swapped to form the new sequence [1,2,4,3]. # The sequence after k-index a[2] to the final element is reversed. Because only one value lies after this index (the 3), the sequence remains unchanged in this instance. Thus the lexicographic successor of the initial state is permuted: [1,2,4,3]. Following this algorithm, the next lexicographic permutation will be [1,3,2,4], and the 24th permutation will be [4,3,2,1] at which point a[k] < a[k + 1] does not exist, indicating that this is the last permutation.

This method uses about 3 comparisons and 1.5 swaps per permutation, amortized over the whole sequence, not counting the initial sort.

====Generation with minimal changes====

An alternative to the above algorithm, the Steinhaus–Johnson–Trotter algorithm, generates an ordering on all the permutations of a given sequence with the property that any two consecutive permutations in its output differ by swapping two adjacent values. This ordering on the permutations was known to 17th-century English bell ringers, among whom it was known as "plain changes". One advantage of this method is that the small amount of change from one permutation to the next allows the method to be implemented in constant time per permutation. The same can also easily generate the subset of even permutations, again in constant time per permutation, by skipping every other output permutation. said by Robert Sedgewick in 1977 to be the fastest algorithm of generating permutations in applications. Generation of these alternate permutations is needed before they are analyzed to determine if they are meandric or not.

The algorithm is recursive. The following table exhibits a step in the procedure. In the previous step, all alternate permutations of length 5 have been generated. Three copies of each of these have a "6" added to the right end, and then a different transposition involving this last entry and a previous entry in an even position is applied (including the identity; i.e., no transposition).

{| class="wikitable" |- ! Previous sets ! Transposition of digits ! Alternate permutations |- | rowspan=3 | 1-2-3-4-5-6 | || 1-2-3-4-5-6 |- | 4, 6 || 1-2-3-6-5-4 |- | 2, 6 || 1-6-3-4-5-2 |- | rowspan=3 | 1-2-5-4-3-6 | || 1-2-5-4-3-6 |- | 4, 6 || 1-2-5-6-3-4 |- | 2, 6 || 1-6-5-4-3-2 |- | rowspan=3 | 1-4-3-2-5-6 | || 1-4-3-2-5-6 |- | 2, 6 || 1-4-3-6-5-2 |- | 4, 6 || 1-6-3-2-5-4 |- | rowspan=3 | 1-4-5-2-3-6 | || 1-4-5-2-3-6 |- | 2, 6 || 1-4-5-6-3-2 |- | 4, 6 || 1-6-5-2-3-4 |}

===Applications===

Permutations are used in the interleaver component of the error detection and correction algorithms, such as turbo codes, for example 3GPP Long Term Evolution mobile telecommunication standard uses these ideas (see 3GPP technical specification 36.212 ). Such applications raise the question of fast generation of permutations satisfying certain desirable properties. One of the methods is based on the permutation polynomials. Also as a base for optimal hashing in Unique Permutation Hashing.