Namespaces
Variants
Actions

Inversion (in combinatorics)

From Encyclopedia of Mathematics
Jump to: navigation, search

Inversion may refer to:

  • An inversion of a permutation on the ordered set \{1,2,\ldots,n\} is a pair i < j such that \pi(i) > \pi(j)
  • A transposition, a permutation that exchanges two elements
  • A derangement, a permutation with no fixed points
How to Cite This Entry:
Inversion (in combinatorics). Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Inversion_(in_combinatorics)&oldid=39878