# Inversion (in combinatorics)

• An inversion of a permutation $\pi$ on the ordered set $\{1,2,\ldots,n\}$ is a pair $i < j$ such that $\pi(i) > \pi(j)$