OurBigBook About$ Donate
 Sign in Sign up

Adjacent transposition (si​=(ii+1))

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Permutation
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
An adjacent transposition exchanges consecutive positions i and i+1 in a permutation, leaving the others fixed; as a permutation of positions it is (ii+1). Every permutation can be sorted using adjacent transpositions. Swapping an out-of-order adjacent pair decreases its inversion number by one because its comparisons with every third entry have the same total before and after the swap. Consequently the minimum number of adjacent transpositions needed to sort a permutation is its inversion number. For 312, the route 312, 132, 123 uses two swaps.

 Ancestors (5)

  1. Permutation
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (6)

  • Adjacent transposition
  • Inversion number
  • Past exam of the representation Theory of Symmetric Groups course of the University of Oxford / 2011 / 3 / c / Solution
  • Permutation generation
  • RSK of an adjacent transposition
  • Steinhaus-Johnson-Trotter algorithm

 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