OurBigBook About$ Donate
 Sign in Sign up

Inversion number (inv(a))

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Permutation Inversion of a permutation
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
The inversion number of a permutation a1​⋯an​ is
inv(a)=#{(i,j):1≤i<j≤n, ai​>aj​}.
(1)
For 3142, the inverted pairs of values are (3,1),(3,2),(4,2), giving three. The inversion number ranges from zero for increasing order to (2n​) for decreasing order; it is the minimum number of adjacent transpositions needed to sort the permutation. Its parity gives the sign of a permutation, (−1)inv(a). The same pair-counting formula defines the word inversion number when repeated symbols are allowed.

 Ancestors (6)

  1. Inversion of a permutation
  2. Permutation
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Adjacent transposition
  • Inversion number
  • Major index

 Synonyms (2)

  • codex/inversion-statistic
  • codex/inversion-count

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook