0
$\begingroup$

What is the easiest way to count the number of opposite order in permutation.
meaning the total of elements in the permutation where $i<j$ and $\sigma_i>\sigma_j$

For example, $3142$, we have $31, 32, 42,$ so $OO(3142)=3$.

$\endgroup$
  • 1
    $\begingroup$ There is only one way to count, and that is by... counting. So the easiest way (which also the hardest way) to count them is by... well... counting them. $\endgroup$ – barak manos Mar 22 '15 at 11:24
  • $\begingroup$ Note that this quantity is sometimes called the disorder of a permutation. $\endgroup$ – Gerry Myerson Mar 22 '15 at 11:53
  • $\begingroup$ It is also used to determine the parity of permutation $\endgroup$ – gbox Mar 22 '15 at 11:56

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.