S2, C2: Permutations Flashcards

1
Q

What is a permutation?

A

A bijective function f: X -> X denoted Sn.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The number of permutations in Sn is…

A

n!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define disjoint

A

A set of cycles is disjoint if no element appears in more than one of them.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Define Cycle Decomposition

A

a cycle decomposition of a permutation a is an expression of a as a product of disjoint cycles.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a (adjacent) transposition?

A

a cycle of length 2

a adjacent transposition is one of the form (i i+1), e.g. (3 4).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is parity?

A

oddness or evenness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

When is a permutation even/odd?

A

It’s said to be even if it can be written as a product of an even number of transpositions.

  • id is even.
  • any transposition is odd.
  • cycles of even length are odd and vice versa.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the sign of a permutation, written sgn(a)?

A

+1 if a is even and -1 if a is odd.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the order of a permutation, a?

A

the least positive integer m such that
a^m = id.
The lcm of the the length of the disjoint cycles.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly