Permutation

In Cauchy's two-line notation,[15] 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

${\displaystyle \sigma ={\begin{pmatrix}1&2&3&4&5\\2&5&4&3&1\end{pmatrix}};}$

this means that σ satisfies σ(1) = 2, σ(2) = 5, σ(3) = 4, σ(4) = 3, and σ(5) = 1. The elements of S may appear in any order in the first row. This permutation could also be written as:

${\displaystyle \sigma ={\begin{pmatrix}3&2&5&1&4\\4&5&1&2&3\end{pmatrix}},}$

or

${\displaystyle \sigma ={\begin{pmatrix}5&1&4&3&2\\1&2&3&4&5\end{pmatrix}}.}$

If there is a "natural" order for the elements of S,[lower-alpha 1] say ${\displaystyle x_{1},x_{2},\ldots ,x_{n}}$, then one uses this for the first row of the two-line notation:

${\displaystyle \sigma ={\begin{pmatrix}x_{1}&x_{2}&x_{3}&\cdots &x_{n}\\\sigma (x_{1})&\sigma (x_{2})&\sigma (x_{3})&\cdots &\sigma (x_{n})\end{pmatrix}}.}$

Under this assumption, one may omit the first row and write the permutation in one-line notation as

${\displaystyle (\sigma (x_{1})\;\sigma (x_{2})\;\sigma (x_{3})\;\cdots \;\sigma (x_{n}))}$,

that is, as an ordered arrangement of the elements of S.[16][17] Care must be taken to distinguish one-line notation from the cycle notation described below. 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.[18] The example above would then be 2 5 4 3 1 since the natural order 1 2 3 4 5 would be assumed for the first row. (It is typical to use commas to separate these entries only if some have two or more digits.) This form is more compact, and is common in elementary combinatorics and computer science. It is especially useful in applications where the elements of S or the permutations are to be compared as larger or smaller.

Cycle notation describes the effect of repeatedly applying the permutation on the elements of the set. It expresses the permutation as a product of cycles; since distinct cycles are disjoint, this is referred to as "decomposition into disjoint cycles".

To write down the permutation ${\displaystyle \sigma }$ in cycle notation, one proceeds as follows:

1. Write an opening bracket then select an arbitrary element x of ${\displaystyle S}$ and write it down: ${\displaystyle (\,x}$
2. Then trace the orbit of x; that is, write down its values under successive applications of ${\displaystyle \sigma }$: ${\displaystyle (\,x\,\sigma (x)\,\sigma (\sigma (x))\,\ldots }$
3. Repeat until the value returns to x and write down a closing parenthesis rather than x: ${\displaystyle (\,x\,\sigma (x)\,\sigma (\sigma (x))\,\ldots \,)}$
4. Now continue with an element y of S, not yet written down, and proceed in the same way: ${\displaystyle (\,x\,\sigma (x)\,\sigma (\sigma (x))\,\ldots \,)(\,y\,\ldots \,)}$
5. Repeat until all elements of S are written in cycles.

So the permutation 2 5 4 3 1 (in one-line notation) could be written as (125)(34) in cycle notation.

While permutations in general do not commute, disjoint cycles do; for example,

$${\displaystyle (\,1\,2\,5\,)(\,3\,4\,)=(\,3\,4\,)(\,1\,2\,5\,).}$$

In addition, each cycle can be written in different ways, by choosing different starting points; for example,

$${\displaystyle (\,1\,2\,5\,)(\,3\,4\,)=(\,5\,1\,2\,)(\,3\,4\,)=(\,2\,5\,1\,)(\,4\,3\,).}$$

One may combine these equalities to write the disjoint cycles of a given permutation in many different ways.

1-cycles are often omitted from the cycle notation, provided that the context is clear; for any element x in S not appearing in any cycle, one implicitly assumes ${\displaystyle \sigma (x)=x}$.[19] The identity permutation, which consists only of 1-cycles, can be denoted by a single 1-cycle (x), by the number 1,[lower-alpha 2] or by id.[20][21]

A convenient feature of cycle notation is that cycle notation of the inverse permutation is given by reversing the order of the elements in the permutation's cycles. For example,

$${\displaystyle [(\,1\,2\,5\,)(\,3\,4\,)]^{-1}=(\,5\,2\,1\,)(\,4\,3\,).}$$

In some combinatorial contexts it is useful to fix a certain order for 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.[22] The canonical cycle notation does not omit one-cycles.

Richard P. Stanley calls the same choice of representation the "standard representation" of a permutation,[23] and Martin Aigner uses the term "standard form" for the same notion.[18] Sergey Kitaev also uses the "standard form" terminology, but reverses both choices; that is, each cycle lists its least element first and the cycles are sorted in decreasing order of their least, that is, first elements.[24]

There are two ways to denote the composition of two permutations. ${\displaystyle \sigma \cdot \pi }$ is the function that maps any element x of the set to ${\displaystyle \sigma (\pi (x))}$. The rightmost permutation is applied to the argument first,[25] because of the way the function application is written.

Since function composition is associative, so is the composition operation on permutations: ${\displaystyle (\sigma \pi )\tau =\sigma (\pi \tau )}$. 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 composition.

Some authors prefer the leftmost factor acting first,[26][27][28] but to that end permutations must be written to the right of their argument, often as an exponent, where σ acting on x is written x^σ; then the product is defined by x^σ·π = (x^σ)^π. However this gives a different rule for multiplying permutations; this article uses the definition where the rightmost permutation is applied first.

A weaker meaning of the term permutation, sometimes used in elementary combinatorics texts, designates those ordered arrangements in which no element occurs more than once, but without the requirement of using all the elements from a given set. These are not permutations except in special cases, but are natural generalizations of the ordered arrangement concept. Indeed, this use often involves considering arrangements of a fixed length k of elements taken from a given set of size n, in other words, these k-permutations of n are the different ordered arrangements of a k-element subset of an n-set (sometimes called variations or arrangements in older literature[lower-alpha 3]). 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 ${\displaystyle k}$-permutations of ${\displaystyle n}$ is denoted variously by such symbols as ${\displaystyle P_{k}^{n}}$, ${\displaystyle _{n}P_{k}}$, ${\displaystyle ^{n}P_{k}}$, ${\displaystyle P_{n,k}}$, or ${\displaystyle P(n,k)}$, and its value is given by the product[29]

${\displaystyle P(n,k)=\underbrace {n\cdot (n-1)\cdot (n-2)\cdots (n-k+1)} _{k\ \mathrm {factors} }}$,

which is 0 when k > n, and otherwise is equal to

${\displaystyle {\frac {n!}{(n-k)!}}.}$

The product is well defined without the assumption that ${\displaystyle n}$ is a non-negative integer, and is of importance outside combinatorics as well; it is known as the Pochhammer symbol ${\displaystyle (n)_{k}}$ or as the ${\displaystyle k}$-th falling factorial power ${\displaystyle n^{\underline {k}}}$ of ${\displaystyle 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:

${\displaystyle C(n,k)={\frac {P(n,k)}{P(k,k)}}={\frac {\tfrac {n!}{(n-k)!}}{\tfrac {k!}{0!}}}={\frac {n!}{(n-k)!\,k!}}.}$

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

Ordered arrangements of k elements of a set S, where repetition is allowed, are called k-tuples. They 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 n elements, the number of k-tuples over S is ${\displaystyle n^{k}.}$ There is no restriction on how often an element can appear in an k-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 a number of times equal exactly to its multiplicity in M. An anagram of a word having some repeated letters is an example of a multiset permutation.[lower-alpha 4] If the multiplicities of the elements of M (taken in some order) are ${\displaystyle m_{1}}$, ${\displaystyle m_{2}}$, ..., ${\displaystyle m_{l}}$ and their sum (that is, the size of M) is n, then the number of multiset permutations of M is given by the multinomial coefficient,[30]

${\displaystyle {n \choose m_{1},m_{2},\ldots ,m_{l}}={\frac {n!}{m_{1}!\,m_{2}!\,\cdots \,m_{l}!}}={\frac {\left(\sum _{i=1}^{l}{m_{i}}\right)!}{\prod _{i=1}^{l}{m_{i}!}}}.}$

For example, the number of distinct anagrams of the word MISSISSIPPI is:[31]

${\displaystyle {\frac {11!}{1!\,4!\,4!\,2!}}=34650}$.

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

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.[32][lower-alpha 5] 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 four circular permutations on four letters are considered to be the same.

     1           4           2           3
   4   3       2   1       3   4       1   2
     2           3           1           4

The circular arrangements are to be read counter-clockwise, 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)!.

The cycles (including the fixed points) of a permutation ${\displaystyle \sigma }$ of a set with n elements partition that set; so the lengths of these cycles form an integer partition of n, which is called the cycle type (or sometimes cycle structure or cycle shape) of ${\displaystyle \sigma }$. There is a "1" in the cycle type for every fixed point of ${\displaystyle \sigma }$, a "2" for every transposition, and so on. The cycle type of ${\displaystyle \beta =(1\,2\,5\,)(\,3\,4\,)(6\,8\,)(\,7\,)}$ is ${\displaystyle (3,2,2,1).}$

This may also be written in a more compact form as [1¹2²3¹]. More precisely, the general form is ${\displaystyle [1^{\alpha _{1}}2^{\alpha _{2}}\dotsm n^{\alpha _{n}}]}$, where ${\displaystyle \alpha _{1},\ldots ,\alpha _{n}}$ are the numbers of cycles of respective length. The number of permutations of a given cycle type is[34]

${\displaystyle {\frac {n!}{1^{\alpha _{1}}2^{\alpha _{2}}\dotsm n^{\alpha _{n}}\alpha _{1}!\alpha _{2}!\dotsm \alpha _{n}!}}}$.

In general, composing permutations written in cycle notation follows no easily described pattern – the cycles of the composition can be different from those being composed. However the cycle type is preserved in the special case of conjugating a permutation ${\displaystyle \sigma }$ by another permutation ${\displaystyle \pi }$, which means forming the product ${\displaystyle \pi \sigma \pi ^{-1}}$. Here, ${\displaystyle \pi \sigma \pi ^{-1}}$ is the conjugate of ${\displaystyle \sigma }$ by ${\displaystyle \pi }$ and its cycle notation can be obtained by taking the cycle notation for ${\displaystyle \sigma }$ and applying ${\displaystyle \pi }$ to all the entries in it.[35] It follows that two permutations are conjugate exactly when they have the same cycle type.

The order of a permutation ${\displaystyle \sigma }$ is the smallest positive integer m so that ${\displaystyle \sigma ^{m}=\mathrm {id} }$. It is the least common multiple of its cycles lengths. For example, the order of ${\displaystyle (\,1\,3\,2)(\,4\,5\,)}$ is ${\displaystyle 2\cdot 3=6}$.

Every permutation of a finite set can be expressed as the product of transpositions.[36] Although many such expressions for a given permutation may exist, either they all contain an even number of transpositions or they all contain an odd number of transpositions. Thus all permutations can be classified as even or odd depending on this number.

This result can be extended so as to assign a sign, written ${\displaystyle \operatorname {sgn} \sigma }$, to each permutation. ${\displaystyle \operatorname {sgn} \sigma =+1}$ if ${\displaystyle \sigma }$ is even and ${\displaystyle \operatorname {sgn} \sigma =-1}$ if ${\displaystyle \sigma }$ is odd. Then for two permutations ${\displaystyle \sigma }$ and ${\displaystyle \pi }$

${\displaystyle \operatorname {sgn} (\sigma \pi )=\operatorname {sgn} \sigma \cdot \operatorname {sgn} \pi .}$

It follows that ${\displaystyle \operatorname {sgn} \left(\sigma \sigma ^{-1}\right)=+1.}$

A permutation matrix is an n × n matrix that has exactly one entry 1 in each column and in each row, and all other entries are 0. There are several different conventions that one can use to assign a permutation matrix to a permutation of {1, 2, ..., n}. One natural approach is to associate to the permutation σ the matrix ${\displaystyle M_{\sigma }}$ whose (i, j) entry is 1 if i = σ(j) and is 0 otherwise. This convention has two attractive properties: first, the product of matrices and of permutations is in the same order, that is, ${\displaystyle M_{\sigma }M_{\pi }=M_{\sigma \circ \pi }}$ for all permutations σ and π. Second, if ${\displaystyle {\bf {e}}_{i}}$ represents the standard ${\displaystyle n\times 1}$ column vector (the vector with ith entry equal to 1 and all other entries equal to 0), then ${\displaystyle M_{\sigma }{\bf {e}}_{i}={\bf {e}}_{\sigma (i)}}$.

For example, with this convention, the matrix associated to the permutation ${\displaystyle \sigma (1,2,3)=(2,1,3)}$ is ${\displaystyle {\begin{pmatrix}0&1&0\\1&0&0\\0&0&1\end{pmatrix}}}$ and the matrix associated to the permutation ${\displaystyle \pi (1,2,3)=(2,3,1)}$ is ${\displaystyle {\begin{pmatrix}0&0&1\\1&0&0\\0&1&0\end{pmatrix}}}$. Then the composition of permutations is ${\displaystyle (\sigma \circ \pi )(1,2,3)=\sigma (2,3,1)=(1,3,2)}$, and the corresponding matrix product is

$${\displaystyle M_{(2,1,3)}M_{(2,3,1)}={\begin{pmatrix}0&1&0\\1&0&0\\0&0&1\end{pmatrix}}{\begin{pmatrix}0&0&1\\1&0&0\\0&1&0\end{pmatrix}}={\begin{pmatrix}1&0&0\\0&0&1\\0&1&0\end{pmatrix}}=M_{(1,3,2)}.}$$

Composition of permutations corresponding to a multiplication of permutation matrices.

It is also common in the literature to find the inverse convention, where a permutation σ is associated to the matrix ${\displaystyle P_{\sigma }=(M_{\sigma })^{-1}=(M_{\sigma })^{T}}$ whose (i, j) entry is 1 if j = σ(i) and is 0 otherwise. In this convention, permutation matrices multiply in the opposite order from permutations, that is, ${\displaystyle P_{\sigma }P_{\pi }=P_{\pi \circ \sigma }}$ for all permutations σ and π. In this correspondence, permutation matrices act by permuting indices of standard ${\displaystyle 1\times n}$ row vectors ${\displaystyle ({\bf {e}}_{i})^{T}}$: one has ${\displaystyle ({\bf {e}}_{i})^{T}P_{\sigma }=({\bf {e}}_{\sigma (i)})^{T}}$.

The Cayley table on the right shows these matrices for permutations of 3 elements.

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 σ = σ₁σ₂...σ_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 ${\displaystyle 1\leq i<n}$ either is an ascent or is a descent of σ.

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.[37]

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

An excedance of a permutation σ₁σ₂...σ_n is an index j such that σ_j > j. If the inequality is not strict (that is, σ_j ≥ j), 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.[39]

There is a relationship between the one-line notation and the canonical cycle notation. Consider the permutation ${\displaystyle (\,2\,)(\,3\,1\,)}$ in canonical cycle notation; if we simply remove the parentheses, we obtain the permutation ${\displaystyle 231}$ 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).[40] Richard P. Stanley calls this correspondence the fundamental bijection.[23]

Let ${\displaystyle f(p)=q}$ be the parentheses-erasing transformation which returns ${\displaystyle q}$ in one-line notation when given ${\displaystyle p}$ in canonical cycle notation. As stated, ${\displaystyle f}$ operates by simply removing all parentheses. The operation of the inverse transformation, ${\displaystyle f^{-1}(q)=p}$, which returns ${\displaystyle p}$ in canonical cycle notation when given ${\displaystyle q}$ in one-line notation, is a bit less intuitive. Given the one-line notation ${\displaystyle q=q_{1}q_{2}\cdots q_{n}}$, the first cycle of ${\displaystyle p}$ in canonical cycle notation must start with ${\displaystyle q_{1}}$. As long as the subsequent elements are smaller than ${\displaystyle q_{1}}$, we are in the same cycle of ${\displaystyle p}$. The second cycle of ${\displaystyle p}$ starts at the smallest index ${\displaystyle j}$ such that ${\displaystyle q_{j}>q_{1}}$. In other words, ${\displaystyle q_{j}}$ is larger than everything else to its left, so it is called a left-to-right maximum. Every cycle in the canonical cycle notation starts with a left-to-right maximum.[40]

For example, in the permutation ${\displaystyle q=312548976}$, 5 is the first element larger than the starting element 3, so the first cycle of ${\displaystyle p}$ must be ${\displaystyle (\,3\,1\,2\,)}$. Then 8 is the next element larger than 5, so the second cycle is ${\displaystyle (\,5\,4\,)}$. Since 9 is larger than 8, ${\displaystyle (\,8\,)}$ is a cycle by itself. Finally, 9 is larger than all the remaining elements to its right, so the last cycle is ${\displaystyle (\,9\,7\,6\,)}$. Concatenating these 4 cycles gives ${\displaystyle p=(\,3\,1\,2\,)(\,5\,4\,)(\,8\,)(\,9\,7\,6\,)}$ in canonical cycle notation.

The following table shows both ${\displaystyle q}$ and ${\displaystyle p}$ for the six permutations of ${\displaystyle 123}$. The bold side of each equality shows the permutation using its designated notation (one-line notation for ${\displaystyle q}$ and canonical cycle notation for ${\displaystyle p}$) while the non-bold side shows the same permutation in the other notation. Comparing the bold side of each column of the table shows the parenthesis removing/restoring operation of Foata's bijection, while comparing the same side of each column (for example, the LHS) shows which permutations are mapped to themselves by the bijection (first 3 rows) and which are not (last 3 rows).

${\displaystyle q=f(p)}$	${\displaystyle p=f^{-1}(q)}$
${\displaystyle \mathbf {123} =(\,1\,)(\,2\,)(\,3\,)}$	${\displaystyle 123=\mathbf {(\,1\,)(\,2\,)(\,3\,)} }$
${\displaystyle \mathbf {132} =(\,1\,)(\,3\,2\,)}$	${\displaystyle 132=\mathbf {(\,1\,)(\,3\,2\,)} }$
${\displaystyle \mathbf {213} =(\,2\,1\,)(\,3\,)}$	${\displaystyle 213=\mathbf {(\,2\,1\,)(\,3\,)} }$
${\displaystyle \mathbf {231} =(\,3\,1\,2\,)}$	${\displaystyle 321=\mathbf {(\,2\,)(\,3\,1\,)} }$
${\displaystyle \mathbf {312} =(\,3\,2\,1\,)}$	${\displaystyle 231=\mathbf {(\,3\,1\,2\,)} }$
${\displaystyle \mathbf {321} =(\,2\,)(\,3\,1\,)}$	${\displaystyle 312=\mathbf {(\,3\,2\,1\,)} }$

As a first corollary, the number of n-permutations with exactly k left-to-right maxima is also equal to the signless Stirling number of the first kind, ${\displaystyle c(n,k)}$. Furthermore, Foata's mapping takes an n-permutation with k-weak excedances to an n-permutations with k − 1 ascents.[40] For example, (2)(31) = 321 has two weak excedances (at index 1 and 2), whereas f(321) = 231 has one ascent (at index 1; that is, from 2 to 3).

In the 15 puzzle the goal is to get the squares in ascending order. Initial positions which have an odd number of inversions are impossible to solve.[41]

An inversion of a permutation σ is a pair (i, j) of positions where the entries of a permutation are in the opposite order: ${\displaystyle i<j}$ and ${\displaystyle \sigma _{i}>\sigma _{j}}$.[42] So a descent is just an inversion at two adjacent positions. For example, the permutation σ = 23154 has three inversions: (1, 3), (2, 3), and (4, 5), for the pairs of entries (2, 1), (3, 1), and (5, 4).

Sometimes an inversion is defined as the pair of values (σ_i,σ_j) 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 σ⁻¹. 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 σ⁻¹. To bring a permutation with k inversions into order (that is, 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 i + 1 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; 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,[43] it is the coefficient of X^k in the expansion of the product

$${\displaystyle \prod _{m=1}^{n}\sum _{i=0}^{m-1}X^{i}=1\left(1+X\right)\left(1+X+X^{2}\right)\cdots \left(1+X+X^{2}+\cdots +X^{n-1}\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).

Let ${\displaystyle \sigma \in S_{n},i,j\in \{1,2,\dots ,n\}}$ such that ${\displaystyle i<j}$ and ${\displaystyle \sigma (i)>\sigma (j)}$. In this case, say the weight of the inversion ${\displaystyle (i,j)}$ is ${\displaystyle \sigma (i)-\sigma (j)}$. Kobayashi (2011) proved the enumeration formula

$${\displaystyle \sum _{i<j,\sigma (i)>\sigma (j)}(\sigma (i)-\sigma (j))=|\{\tau \in S_{n}\mid \tau \leq \sigma ,\tau {\text{ is bigrassmannian}}\}}$$

where ${\displaystyle \leq }$ denotes Bruhat order in the symmetric groups. This graded partial order often appears in the context of Coxeter groups.

One way to represent permutations of n things 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 d_n, d_n−1, ..., d₂, d₁, where d_i is a non-negative integer less than i (one may omit d₁, 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 less than n!, the bases (place values or multiplication factors) for successive digits are (n − 1)!, (n − 2)!, ..., 2!, 1!. The second step interprets this sequence as a Lehmer code or (almost equivalently) as an inversion table.

Rothe diagram for ${\displaystyle \sigma =(6,3,8,1,4,9,7,2,5)}$

σi i	1	2	3	4	5	6	7	8	9	Lehmer code
1	×	×	×	×	×	•				d9 = 5
2	×	×	•							d8 = 2
3	×	×		×	×		×	•		d7 = 5
4	•									d6 = 0
5		×		•						d5 = 1
6		×			×		×		•	d4 = 3
7		×			×		•			d3 = 2
8		•								d2 = 0
9					•					d1 = 0
Inversion table	3	6	1	2	4	0	2	0	0

In the Lehmer code for a permutation σ, the number d_n represents the choice made for the first term σ₁, the number d_n−1 represents the choice made for the second term σ₂ among the remaining n − 1 elements of the set, and so forth. More precisely, each d_n+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 d_n+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 d_n+1−k counts the number of inversions (i,j) where k = σ_j occurs as the smaller of the two values appearing in inverted order.[44] Both encodings can be visualized by an n by n Rothe diagram[45] (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 d_n, d_n−1, ..., d₂, d₁ 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 d_n+1−i other ones, and remove that element from the list. To convert an inversion table d_n, d_n−1, ..., d₂, d₁ into the corresponding permutation, one can traverse the numbers from d₁ to d_n 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 d_n, d_n−1, ..., d₂, d₁ has an ascent n − i if and only if d_i ≥ d_i+1.

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 n²/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.

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 d₁,d₂,...,d_n satisfying 0 ≤ d_i < i (since d₁ 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.[46] 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 d_i 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 d_i+1 = i, the first assignment will copy an uninitialized value, but the second will overwrite it with the correct value i.

However, Fisher-Yates is not the fastest algorithm for generating a permutation, because Fisher-Yates is essentially a sequential algorithm and "divide and conquer" procedures can achieve the same result in parallel.[47]

There are many ways to systematically generate all permutations of a given sequence.[48] One classic, simple, and flexible algorithm is based upon finding the next permutation in lexicographic ordering, if it exists. It can handle repeated values, for which case it generates each distinct multiset permutation 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. It begins 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 rediscovered frequently.[49]

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

1. Find the largest index k such that a[k] < a[k + 1]. If no such index exists, the permutation is the last permutation.
2. Find the largest index l greater than k such that a[k] < a[l].
3. Swap the value of a[k] with that of a[l].
4. 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:

1. 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.
2. 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].
3. The values of a[2] and a[3] are swapped to form the new sequence [1, 2, 4, 3].
4. 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.[50]

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.[49]

An alternative to Steinhaus–Johnson–Trotter is Heap's algorithm,[51] said by Robert Sedgewick in 1977 to be the fastest algorithm of generating permutations in applications.[48]

The following figure shows the output of all three aforementioned algorithms for generating all permutations of length ${\displaystyle n=4}$, and of six additional algorithms described in the literature.

Ordering of all permutations of length ${\displaystyle n=4}$ generated by different algorithms. The permutations are color-coded, where   1,   2,   3,   4.[52]

1. Lexicographic ordering;
2. Steinhaus–Johnson–Trotter algorithm;
3. Heap's algorithm;
4. Ehrlich's star-transposition algorithm:[49] in each step, the first entry of the permutation is exchanged with a later entry;
5. Zaks' prefix reversal algorithm:[53] in each step, a prefix of the current permutation is reversed to obtain the next permutation;
6. Sawada-Williams' algorithm:[54] each permutation differs from the previous one either by a cyclic left-shift by one position, or an exchange of the first two entries;
7. Corbett's algorithm:[55] each permutation differs from the previous one by a cyclic left-shift of some prefix by one position;
8. Single-track ordering:[56] each column is a cyclic shift of the other columns;
9. Single-track Gray code:[56] each column is a cyclic shift of the other columns, plus any two consecutive permutations differ only in one or two transpositions.

Meandric systems give rise to meandric permutations, a special subset of alternate permutations. An alternate permutation of the set {1, 2, ..., 2n} is a cyclic permutation (with no fixed points) such that the digits in the cyclic notation form alternate between odd and even integers. Meandric permutations are useful in the analysis of RNA secondary structure. Not all alternate permutations are meandric. A modification of Heap's algorithm has been used to generate all alternate permutations of order n (that is, of length 2n) without generating all (2n)! permutations.[57] 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; that is, no transposition).

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[58]). 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.[59]