Difference between revisions of "Permutation"
Mysmartmouth (talk | contribs) (→See also) |
Archimedes1 (talk | contribs) (→See also) |
||
| Line 22: | Line 22: | ||
== See also == | == See also == | ||
| + | *[[Combinations]] | ||
* [[Combinatorics]] | * [[Combinatorics]] | ||
* [[Derangement]] | * [[Derangement]] | ||
Revision as of 20:06, 13 October 2007
This article is a stub. Help us out by expanding it.
A permutation of a set of 
objects is any rearrangement (linear ordering) of the objects. There are 
(the factorial of ) permutations of a set with distinct objects.
One can also consider permutations of infinite sets. In this case, a permutation of a set 
is simply a bijection between and itself.
Notations
A given permutation of a finite set can be denoted in a variety of ways. The most straightforward representation is simply to write down what the permutation looks like. For example, the permutations of the set 
are 
and 
. We often drop the brackets and commas, so the permutation 
would just be represented by 
.
Another common notation is cycle notation.
The Symmetric Group
The set of all permutations of an 
-element set is denoted 
. In fact, forms a group, known as the Symmetric group, under the operation of permutation composition.
A permutation in which no obect remains in the same place it started is called a derangement.
Picking ordered subsets of a set
An important question is how many ways to pick an -element subset of a set with elements, where order matters. To find how many ways we can do this, note that for the first of the elements, we have different objects we can choose from. For the second element, there are 
objects we can choose, 
for the third, and so on. In general, the number of ways to permute objects from a set of is given by
.
