Inversion (discrete mathematics)

src: i.ytimg.com

In computer science and discrete mathematics a sequence has an inversion where two of its elements are out of their natural order.

Video Inversion (discrete mathematics)

Definitions

Inversion

Let ${\displaystyle \pi }$ be a permutation. If ${\displaystyle i<j}$ and ${\displaystyle \pi (i)>\pi (j)}$, either the pair of places ${\displaystyle (i,j)}$ or the pair of elements ${\displaystyle {\bigl (}\pi (i),\pi (j){\bigr )}}$ is called an inversion of ${\displaystyle \pi }$.

The inversion is usually defined for permutations, but may also be defined for sequences:
Let ${\displaystyle S}$ be a sequence (or multiset permutation). If ${\displaystyle i<j}$ and ${\displaystyle S(i)>S(j)}$, either the pair of places ${\displaystyle (i,j)}$ or the pair of elements ${\displaystyle {\bigl (}S(i),S(j){\bigr )}}$ is called an inversion of ${\displaystyle S}$.

For sequences inversions according to the element-based definition are not unique, because different pairs of places may have the same pair of values.

The inversion set is the set of all inversions. A permutation's inversion set according to the place-based definition is that of the inverse permutation's inversion set according to the element-based definition, and vice versa, just with the elements of the pairs exchanged.

Inversion number

The inversion number is the cardinality of inversion set. It is a common measure of the sortedness of a permutation or sequence.

It is the number of crossings in the arrow diagram of the permutation, its Kendall tau distance from the identity permutation, and the sum of each of the inversion related vectors defined below.

It does not matter if the place-based or the element-based definition of inversion is used to define the inversion number, because a permutation and its inverse have the same number of inversions.

Other measures of (pre-)sortedness include the minimum number of elements that can be deleted from the sequence to yield a fully sorted sequence, the number and lengths of sorted "runs" within the sequence, the Spearman footrule (sum of distances of each element from its sorted position), and the smallest number of exchanges needed to sort the sequence. Standard comparison sorting algorithms can be adapted to compute the inversion number in time O(n log n).

Inversion related vectors

Three similar vectors are in use that condense the inversions of a permutation into a vector that uniquely determines it. They are often called inversion vector or Lehmer code. (A list of sources is found here.)

This article uses the term inversion vector (${\displaystyle v}$) like Wolfram. The remaining two vectors are sometimes called left and right inversion vector, but to avoid confusion with the inversion vector this article calls them left inversion count (${\displaystyle l}$) and right inversion count (${\displaystyle r}$). Interpreted as a factorial number the left inversion count gives the permutations reverse colexicographic, and the right inversion count gives the lexicographic index.

Inversion vector ${\displaystyle v}$:
With the element-based definition ${\displaystyle v(i)}$ is the number of inversions whose smaller (right) component is ${\displaystyle i}$.

${\displaystyle v(i)}$ is the number of elements in ${\displaystyle \pi }$ greater than ${\displaystyle i}$ before ${\displaystyle i}$.

${\displaystyle v(i)~~=~~\#\{k\mid k>i~\land ~\pi ^{-1}(k)<\pi ^{-1}(i)\}}$

Left inversion count ${\displaystyle l}$:
With the place-based definition ${\displaystyle l(i)}$ is the number of inversions whose bigger (right) component is ${\displaystyle i}$.

${\displaystyle l(i)}$ is the number of elements in ${\displaystyle \pi }$ greater than ${\displaystyle \pi (i)}$ before ${\displaystyle \pi (i)}$.

${\displaystyle l(i)~~=~~\#\left\{k\mid k<i~\land ~\pi (k)>\pi (i)\right\}}$

Right inversion count ${\displaystyle r}$, often called Lehmer code:
With the place-based definition ${\displaystyle r(i)}$ is the number of inversions whose smaller (left) component is ${\displaystyle i}$.

${\displaystyle r(i)}$ is the number of elements in ${\displaystyle \pi }$ smaller than ${\displaystyle \pi (i)}$ after ${\displaystyle \pi (i)}$.

${\displaystyle r(i)~~=~~\#\{k\mid k>i~\land ~\pi (k)<\pi (i)\}}$

Both ${\displaystyle v}$ and ${\displaystyle r}$ can be found with the help of a Rothe diagram, which is a permutation matrix with the 1s represented by dots, and an inversion (often represented by a cross) in every position that has a dot to the right and below it. ${\displaystyle r(i)}$ is the sum of inversions in row ${\displaystyle i}$ of the Rothe diagram, while ${\displaystyle v(i)}$ is the sum of inversions in column ${\displaystyle i}$. The permutation matrix of the inverse is the transpose, therefore ${\displaystyle v}$ of a permutation is ${\displaystyle r}$ of its inverse, and vice versa.

Maps Inversion (discrete mathematics)

Example: All permutations of four elements

The following sortable table shows the 24 permutations of four elements with their place-based inversion sets, inversion related vectors and inversion numbers. (The small columns are reflections of the columns next to them, and can be used to sort them in colexicographic order.)

It can be seen that ${\displaystyle v}$ and ${\displaystyle l}$ always have the same digits, and that ${\displaystyle l}$ and ${\displaystyle r}$ are both related to the place-based inversion set. The nontrivial elements of ${\displaystyle l}$ are the sums of the descending diagonals of the shown triangle, and those of ${\displaystyle r}$ are the sums of the ascending diagonals. (Pairs in descending diagonals have the right components 2, 3, 4 in common, while pairs in ascending diagonals have the left components 1, 2, 3 in common.)

The default order of the table is reverse colex order by ${\displaystyle \pi }$, which is the same as colex order by ${\displaystyle l}$. Lex order by ${\displaystyle \pi }$ is the same as lex order by ${\displaystyle r}$.

src: rspa.royalsocietypublishing.org

Weak order of permutations

The set of permutations on n items can be given the structure of a partial order, called the weak order of permutations, which forms a lattice.

The Hasse diagram of the inversion sets ordered by the subset relation forms the skeleton of a permutohedron.

If a permutation is assigned to each inversion set using the place-based definition, the resulting order of permutations is that of the permutohedron, where an edge corresponds to the swapping of two elements with consecutive values. This is the weak order of permutations. The identity is its minimum, and the permutation formed by reversing the identity is its maximum.

If a permutation were assigned to each inversion set using the element-based definition, the resulting order of permutations would be that of a Cayley graph, where an edge corresponds to the swapping of two elements on consecutive places. This Cayley graph of the symmetric group is similar to its permutohedron, but with each permutation replaced by its inverse.

src: ds055uzetaobb.cloudfront.net

See also

• Factorial number system
• Permutation graph
• Transpositions, simple transpositions, inversions and sorting
• Damerau-Levenshtein distance
• Parity of a permutation

Sequences in the OEIS:

• Sequences related to factorial base representation
• Factorial numbers: A007623 and A108731
• Inversion numbers: A034968
• Inversion sets of finite permutations interpreted as binary numbers: A211362   (related permutation: A211363)
• Finite permutations that have only 0s and 1s in their inversion vectors: A059590   (their inversion sets: A211364)
• Numbers of permutations of n elements with k inversions; Mahonian numbers: A008302   (their row maxima; Kendall-Mann numbers: A000140)
• Number of connected labeled graphs with n edges and n nodes: A057500

src: i.ytimg.com

References

Source bibliography

Further reading

• Margolius, Barbara H. (2001). "Permutations with Inversions". Journal of Integer Sequences. 4. 

Presortedness measures

• Mannila, Heikki (1984). "Measures of presortedness and optimal sorting algorithms". Lecture Notes in Computer Science. 172: 324-336. doi:10.1007/3-540-13345-3_29. 
• Estivill-Castro, Vladimir; Wood, Derick (1989). "A new measure of presortedness". Information and Computation. 83 (1): 111-119. doi:10.1016/0890-5401(89)90050-3. 
• Skiena, Steven S. (1988). "Encroaching lists as a measure of presortedness". BIT. 28 (4): 755-784. doi:10.1007/bf01954897. 

Source of article : Wikipedia