Combinatorics

back to home

Contents

1 Permutations 1
1.1 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Inversions and Signum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

1 Permutations

1.1 Notation

• A Permutation is an bijective function that maps from a set S onto itself. The entity itself is unique even
though the notation is not:
 
1 2 3 4 5
• Two line Notation σ =
5 1 4 3 2


• One line Notation σ = 5 1 4 3 2
• Disjoint Cycle Notation σ = (152)(34) = (215)(43), where (152) should be understood as (1, σ(1), σ(σ(1)))).
Product of parenthesis means function composition and the order of composition is as usual, from right to left.
• Transpose Notation σ = (12)(15)(34) decompose into cycles of two. Conversion from cycle notation:
(2546) = (26)(24)(25) = (12)(16)(14)(15)(12).
• Parity Any permutation is either even or odd, depending on the parity of the number of switching needed
to return to 1,2...n.

1.2 Inversions and Signum

• Inversions In a Permutation Within a permutation h...j...k...iρ , j > k counts as one inversion of the
natural order.

• Row Switching and Inversions switching a row basis in the permutation matrix flips the parity of the
number of inversions in the permutation. Pf: every switching can be decomposed into odd number of adjacent
switchings, each of which increases or decreases the # inversion by 1. Hence an odd number of addition or
subtraction is incurred, which flips the parity of the #.
• Inversions and Row Ops to identity Perm. # inversions=# row switching to get to I.

• Signum of a Permutation Signum sgn(σ) , (−1)# of Inversion .

• Signum of Inverse Every permutation or permutation matrix σ has a inverse σ −1 . Pf: bijective map. Further
sgn(σ) = sgn(σ −1 ). Pf: transpose notation.

1
References