Recognizing even or odd permutation easily?

  • Thread starter Thread starter vulpe
  • Start date Start date
  • Tags Tags
    even Permutation
Click For Summary
Determining if a permutation is even or odd can be achieved by counting the number of swaps needed to return to the identity arrangement. For a given permutation, such as 5,2,1,4,6,3, one can identify the necessary swaps to sort it, which in this case results in an odd permutation. Another method involves counting inversions, where pairs of elements are considered inverted if a larger number precedes a smaller one; an odd number of inversions indicates an odd permutation. Additionally, analyzing the cycle structure of the permutation can also reveal its parity, with odd cycles contributing to an overall odd classification. Understanding these methods simplifies the process of identifying permutation parity without exhaustive enumeration.
vulpe
Messages
6
Reaction score
0
Hello folks, I'm not even sure if this is the place to put this but with some luck it might be.

I just have a general question about permutations. I understand the concept of even and odd permutations of a set of numbers, what I am hoping for is an easy way to figure out if (given a scrambled arrangement of the original set) the new set is even or odd? Obviously other than the trivial solution of going through it permutation by permutation and counting.

Thanks for any input!
 
Physics news on Phys.org
The most basic odd permutations are those that swap 2 numbers. So count how many of those permutations must be applied to reach the identity. For example, 321 is odd (swap 3 and 1) but 312 is even (two swaps are required). It's a simple as that.
 
I understand what odd and even permutations are, my question makes more sense if I use an example perhaps. Imagine that instead of 1,2,3 you have a set that's 1,2,3,4,5,6 . Now tell me, is 5,2,1,4,6,3 even or odd without taking forever haha :P
 
Hi, vulpe,
I'd attempt the swaps that put each peg in place. In your example,
5,2,1,4,6,3
1,2,5,4,6,3 (1,5)
1,2,3,4,6,5 (3,5)
1,2,3,4,5,6 (5,6)
hence this one is odd. At worst, you'd do as many swaps as elements are (minus 1, actually).
 
Go through all 2-element subsets of the numbers in the permutation and see for how many of these the greater number comes before the smaller in the permutation, call it an inversion if this is the case. If the number of inversions is odd, the permutaion is odd, otherwise even.

For example, in the permutation given by (2 6 1 4 3 5), (that is: 1 is mapped to 2, 2 to 6, 3 to 1, etc.) there are 6 inversions: (2,1), (6,1), (6,4), (6,3), (6,5), (4,3). 6 is en even number, so the permutation is even.
 
Another approach using the cycle structure.

In your example: the permutation taking 1, 2, 3, 4, 5, 6 to 5, 2, 1, 4, 6, 3 has cycle structure (1 5 6 3) (2) (4). (If you don't know how to write down the cycle structure of a permutation, learn!) Now, a 4-cycle is odd and a 1-cycle is even, so we have odd × even × even = odd, so the permutation is odd.
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

Replies
8
Views
5K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 45 ·
2
Replies
45
Views
6K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
2
Views
5K
  • · Replies 2 ·
Replies
2
Views
6K
  • · Replies 2 ·
Replies
2
Views
2K