|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Unreferenced|date=April 2011}}
| | Hello. Let me [http://Browse.Deviantart.com/?qh=§ion=&global=1&q=introduce+creator introduce creator]. His name is Major and hubby totally loves this heading. Researching fashion is the hobby I will never stop doing. Production and planning is my regular job now but soon my girlfriend and I will start individual business. Years ago he relocated to New Hampshire and his parents live nearby. I've been working in my little website other [http://Answers.Yahoo.com/search/search_result?p=people+time&submit-go=Search+Y!+Answers people time] this moment. Check it out here: http://www.famoussocialmedia.com/profile/KBlankens<br><br>Here is my page: [http://www.famoussocialmedia.com/profile/KBlankens farrah abraham sex tape] |
| [[File:Gray code * bit reversal 16.svg|thumb|350px|16-bit [[Gray code]] permutation ''G''<br>[[matrix multiplication|multiplied]] with the [[bit-reversal permutation]] ''B''<br><br>''G'' has <big>2</big> fixed points, <big>1</big> [[Transposition (mathematics)|2-cycle]] and <big>3</big> 4-cycles<br>''B'' has <big>4</big> fixed points and <big>6</big> 2-cycles<br>''GB'' has <big>2</big> fixed points and <big>2</big> 7-cycles]]
| |
| [[File:Permutation matrix; P * column.svg|thumb|200px|''P'' * (1,2,3,4)<sup>T</sup> = (4,1,3,2)<sup>T</sup><br><br>Permutation of four elements with <big>1</big> fixed point and <big>1</big> 3-cycle]]
| |
| | |
| In [[combinatorics|combinatorial]] [[mathematics]], the '''cycles''' of a [[permutation]] ''π'' of a finite [[Set (mathematics)|set]] '''S''' correspond bijectively to the [[orbit (group theory)|orbit]]s of the subgroup generated by ''π'' acting on ''S''. These orbits are [[subset]]s of '''S''' that can be written as { ''c''<sub>1</sub>, ..., ''c''<sub>''l''</sub> }, such that
| |
| | |
| :''π''(''c''<sub>''i''</sub>) = ''c''<sub>''i'' + 1</sub> for ''i'' = 1, ..., ''l'' − 1, and ''π''(''c''<sub>''l''</sub>) = ''c''<sub>1</sub>.
| |
| | |
| The corresponding cycle of ''π'' is written as ( ''c''<sub>1</sub> ''c''<sub>2</sub> ... ''c''<sub>''n''</sub> ); this expression is not unique since ''c''<sub>1</sub> can be chosen to be any element of the orbit.
| |
| | |
| The size ''l'' of the orbit is called the length of the corresponding cycle; when ''l'' = 1, the cycle is called a '''[[fixed point (mathematics)|fixed point]]'''. In counting the fixed points among the cycles of a permutation, the combinatorial notion of cycle differs from the group theoretical one, where a [[cycle (mathematics)|cycle]] is a permutation in itself, and its length cannot be 1 (even if that were allowed, this would not suffice to distinguish different fixed points, since any cycle of length 1 would be equal to the identity permutation).
| |
| | |
| A permutation is determined by giving an expression for each of its cycles, and one notation for permutations consist of writing such expressions one after another in some order. For example, let
| |
| | |
| :<math> \pi
| |
| = \begin{pmatrix} 1 & 6 & 7 & 2 & 5 & 4 & 8 & 3 \\ 2 & 8 & 7 & 4 & 5 & 3 & 6 & 1 \end{pmatrix}
| |
| = \begin{pmatrix} 1 & 2 & 4 & 3 & 5 & 6 & 7 & 8 \\ 2 & 4 & 3 & 1 & 5 & 8 & 7 & 6 \end{pmatrix}
| |
| </math>
| |
| | |
| be a permutation that maps 1 to 2, 6 to 8, etc. Then one may write
| |
| | |
| :''π'' = ( 1 2 4 3 ) ( 5 ) ( 6 8 ) (7) = (7) ( 1 2 4 3 ) ( 6 8 ) ( 5 ) = ( 4 3 1 2 ) ( 8 6 ) ( 5 ) (7) = ...
| |
| | |
| Here 5 an 7 are fixed points of ''π'', since ''π''(5)=5 and ''π''(7)=7. This kind of expression resembles the group-theoretic decomposition of a permutation as a product of cycles with disjoint orbits, but in that decomposition the fixed points do not appear.
| |
| | |
| There are different ways to write a permutation as a list of its cycles, but the number of cycles and their contents are given by the [[partition of a set|partition]] of ''S'' into orbits, and these are therefore the same for all such expressions.
| |
| | |
| == Counting permutations by number of cycles ==
| |
| The unsigned [[Stirling number]] of the first kind, ''s''(''k'', ''j'') counts the number of permutations of ''k'' elements with exactly ''j'' disjoint cycles.
| |
| | |
| === Properties ===
| |
| | |
| :'''(1)''' For every ''k'' > 0 : ''s''(''k'', ''k'') = 1.
| |
| | |
| :'''(2)''' For every ''k'' > 0 : ''s''(''k'', 1) = (''k'' − 1)!.
| |
| | |
| :'''(3)''' For every ''k'' > ''j'' > 1, ''s''(''k'', ''j'') = ''s''(''k'' − 1,''j'' − 1) + ''s''(''k'' − 1, ''j'')·(''k'' − 1)
| |
| | |
| === Reasons for properties ===
| |
| | |
| :'''(1)''' There is only one way to construct a permutation of ''k'' elements with ''k'' cycles: Every cycle must have length 1 so every element must be a fixed point.
| |
| | |
| ::'''(2.a)''' Every cycle of length ''k'' may be written as permutation of the number 1 to ''k''; there are ''k''! of these permutations.
| |
| | |
| ::'''(2.b)''' There are ''k'' different ways to write a given cycle of length ''k'', e.g. ( 1 2 4 3 ) = ( 2 4 3 1 ) = ( 4 3 1 2 ) = ( 3 1 2 4 ).
| |
| | |
| ::'''(2.c)''' Finally: ''s''(''k'', 1) = ''k''!/''k'' = (''k'' − 1)!.
| |
| | |
| :'''(3)''' There are two different ways to construct a permutation of ''k'' elements with ''j'' cycles:
| |
| | |
| ::'''(3.a)''' If we want element ''k'' to be a fixed point we may choose one of the ''s''(''k'' − 1, ''j'' − 1) permutations with ''k'' − 1 elements and ''j'' − 1 cycles and add element ''k'' as a new cycle of length 1.
| |
| | |
| ::'''(3.b)''' If we want element ''k'' ''not'' to be a fixed point we may choose one of the ''s''(''k'' − 1, ''j'' ) permutations with ''k'' − 1 elements and ''j'' cycles and insert element ''k'' in an existing cycle in front of one of the ''k'' − 1 elements.
| |
| | |
| === Some values ===
| |
| {| class="wikitable"
| |
| |-
| |
| ! rowspan="2" valign="center" | k
| |
| ! colspan="9" | j
| |
| !
| |
| |-
| |
| ! 1
| |
| ! 2
| |
| ! 3
| |
| ! 4
| |
| ! 5
| |
| ! 6
| |
| ! 7
| |
| ! 8
| |
| ! 9
| |
| ! sum
| |
| |-
| |
| ! 1
| |
| | align="right" | 1
| |
| | colspan="8" |
| |
| | align="right" | 1
| |
| |-
| |
| ! 2
| |
| | align="right" | 1
| |
| | align="right" | 1
| |
| | colspan="7" |
| |
| | align="right" | 2
| |
| |-
| |
| ! 3
| |
| | align="right" | 2
| |
| | align="right" | 3
| |
| | align="right" | 1
| |
| | colspan="6" |
| |
| | align="right" | 6
| |
| |-
| |
| ! 4
| |
| | align="right" | 6
| |
| | align="right" | 11
| |
| | align="right" | 6
| |
| | align="right" | 1
| |
| | colspan="5" |
| |
| | align="right" | 24
| |
| |-
| |
| ! 5
| |
| | align="right" | 24
| |
| | align="right" | 50
| |
| | align="right" | 35
| |
| | align="right" | 10
| |
| | align="right" | 1
| |
| | colspan="4" |
| |
| | align="right" | 120
| |
| |-
| |
| ! 6
| |
| | align="right" | 120
| |
| | align="right" | 274
| |
| | align="right" | 225
| |
| | align="right" | 85
| |
| | align="right" | 15
| |
| | align="right" | 1
| |
| | colspan="3" |
| |
| | align="right" | 720
| |
| |-
| |
| ! 7
| |
| | align="right" | 720
| |
| | align="right" | 1,764
| |
| | align="right" | 1,624
| |
| | align="right" | 735
| |
| | align="right" | 175
| |
| | align="right" | 21
| |
| | align="right" | 1
| |
| | colspan="2" |
| |
| | align="right" | 5,040
| |
| |-
| |
| ! 8
| |
| | align="right" | 5,040
| |
| | align="right" | 13,068
| |
| | align="right" | 13,132
| |
| | align="right" | 6,769
| |
| | align="right" | 1,960
| |
| | align="right" | 322
| |
| | align="right" | 28
| |
| | align="right" | 1
| |
| | colspan="1" |
| |
| | align="right" | 40,320
| |
| |-
| |
| ! 9
| |
| | align="right" | 40,320
| |
| | align="right" | 109,584
| |
| | align="right" | 118,124
| |
| | align="right" | 67,284
| |
| | align="right" | 22,449
| |
| | align="right" | 4,536
| |
| | align="right" | 546
| |
| | align="right" | 36
| |
| | align="right" | 1
| |
| | align="right" | 362,880
| |
| |-
| |
| !
| |
| ! 1
| |
| ! 2
| |
| ! 3
| |
| ! 4
| |
| ! 5
| |
| ! 6
| |
| ! 7
| |
| ! 8
| |
| ! 9
| |
| ! sum
| |
| |}
| |
| | |
| == Counting permutations by number of fixed points ==
| |
| | |
| The value ''f''(''k'', ''j'') counts the number of permutations of ''k'' elements with exactly ''j'' fixed points. For the main article on this topic, see [[rencontres numbers]].
| |
| | |
| === Properties ===
| |
| | |
| :'''(1)''' For every ''j'' < 0 or ''j'' > ''k'' : ''f''(''k'', ''j'') = 0. | |
| | |
| :'''(2)''' ''f''(0, 0) = 1.
| |
| | |
| :'''(3)''' For every ''k'' > 1 and ''k'' ≥ ''j'' ≥ 0, ''f''(''k'', ''j'') = ''f''(''k'' − 1, ''j'' − 1) + ''f''(''k'' − 1, ''j'')·(''k'' − 1 − ''j'') + ''f''(''k'' − 1, ''j'' + 1)·(''j'' + 1)
| |
| | |
| === Reasons for properties ===
| |
| | |
| '''(3)''' There are three different methods to construct a permutation of ''k'' elements with ''j'' fixed points:
| |
| | |
| :'''(3.a)''' We may choose one of the ''f''(''k'' − 1, ''j'' − 1) permutations with ''k'' − 1 elements and ''j'' − 1 fixed points and add element ''k'' as a new fixed point.
| |
| | |
| :'''(3.b)''' We may choose one of the ''f''(''k'' − 1, ''j'') permutations with ''k'' − 1 elements and ''j'' fixed points and insert element ''k'' in an existing cycle of length > 1 in front of one of the (''k'' − 1) − ''j'' elements.
| |
| | |
| :'''(3.c)''' We may choose one of the ''f''(''k'' − 1, ''j'' + 1) permutations with ''k'' − 1 elements and ''j'' + 1 fixed points and join element ''k'' with one of the ''j'' + 1 fixed points to a cycle of length 2.
| |
| | |
| === Some values ===
| |
| {| class="wikitable"
| |
| |-
| |
| ! rowspan="2" valign="center" | k
| |
| ! colspan="10" | j
| |
| !
| |
| |-
| |
| ! 0
| |
| ! 1
| |
| ! 2
| |
| ! 3
| |
| ! 4
| |
| ! 5
| |
| ! 6
| |
| ! 7
| |
| ! 8
| |
| ! 9
| |
| ! sum
| |
| |-
| |
| ! 1
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="8" |
| |
| | align="right" | 1
| |
| |-
| |
| ! 2
| |
| | align="right" | 1
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="7" |
| |
| | align="right" | 2
| |
| |-
| |
| ! 3
| |
| | align="right" | 2
| |
| | align="right" | 3
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="6" |
| |
| | align="right" | 6
| |
| |-
| |
| ! 4
| |
| | align="right" | 9
| |
| | align="right" | 8
| |
| | align="right" | 6
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="5" |
| |
| | align="right" | 24
| |
| |-
| |
| ! 5
| |
| | align="right" | 44
| |
| | align="right" | 45
| |
| | align="right" | 20
| |
| | align="right" | 10
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="4" |
| |
| | align="right" | 120
| |
| |-
| |
| ! 6
| |
| | align="right" | 265
| |
| | align="right" | 264
| |
| | align="right" | 135
| |
| | align="right" | 40
| |
| | align="right" | 15
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="3" |
| |
| | align="right" | 720
| |
| |-
| |
| ! 7
| |
| | align="right" | 1,854
| |
| | align="right" | 1,855
| |
| | align="right" | 924
| |
| | align="right" | 315
| |
| | align="right" | 70
| |
| | align="right" | 21
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="2" |
| |
| | align="right" | 5,040
| |
| |-
| |
| ! 8
| |
| | align="right" | 14,833
| |
| | align="right" | 14,832
| |
| | align="right" | 7,420
| |
| | align="right" | 2,464
| |
| | align="right" | 630
| |
| | align="right" | 112
| |
| | align="right" | 28
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | colspan="1" |
| |
| | align="right" | 40,320
| |
| |-
| |
| ! 9
| |
| | align="right" | 133,496
| |
| | align="right" | 133,497
| |
| | align="right" | 66,744
| |
| | align="right" | 22,260
| |
| | align="right" | 5,544
| |
| | align="right" | 1,134
| |
| | align="right" | 168
| |
| | align="right" | 36
| |
| | align="right" | 0
| |
| | align="right" | 1
| |
| | align="right" | 362,880
| |
| |-
| |
| !
| |
| ! 0
| |
| ! 1
| |
| ! 2
| |
| ! 3
| |
| ! 4
| |
| ! 5
| |
| ! 6
| |
| ! 7
| |
| ! 8
| |
| ! 9
| |
| ! sum
| |
| |}
| |
| | |
| === Alternate calculations ===
| |
| | |
| :<math>f(k,1)=\sum_{i=1}^k(-1)^{i+1}{k \choose i}i(k-i)!</math><br>
| |
| | |
| Example: ''f''(5, 1) = 5×1×4! − 10×2×3! + 10×3×2! - 5×4×1! + 1×5×0!
| |
| | |
| := 120 - 120 + 60 - 20 + 5 = 45. | |
| | |
| :<math>f(k,0)=k!-\sum_{i=1}^k(-1)^{i+1}{k \choose i}(k-i)!</math><br> | |
| | |
| Example: ''f''(5, 0) = 120 - ( 5×4! - 10×3! + 10×2! - 5×1! + 1×0! )
| |
| | |
| := 120 - ( 120 - 60 + 20 - 5 + 1 ) = 120 - 76 = 44.
| |
| | |
| :For every ''k'' > 1:
| |
| | |
| ::<math>f(k,0)=(k-1)(f(k-1,0)+f(k-2,0))</math>
| |
| | |
| Example: ''f''(5, 0) = 4 × ( 9 + 2 ) = 4 × 11 = 44
| |
| | |
| :For every ''k'' > 1:
| |
| | |
| ::<math>f(k,0)=k!\sum_{i=2}^k(-1)^i/i!</math><br>
| |
| | |
| Example: ''f''(5, 0) = 120 × ( 1/2 - 1/6 + 1/24 - 1/120 )
| |
| | |
| := 120 × ( 60/120 - 20/120 + 5/120 - 1/120 ) = 120 × 44/120 = 44 | |
| | |
| :<math>f(k,0)\approx k!/e</math>
| |
| | |
| :where e is [[e (mathematical constant)|Euler's number]] ≈ 2.71828
| |
| | |
| == See also ==
| |
| | |
| * [[Cycle (mathematics)|Cycle]]
| |
| * [[Cyclic permutation]]
| |
| * [[Cycle notation]]
| |
| [[Category:Permutations]]
| |
| [[Category:Fixed points (mathematics)]]
| |