In combinatorial mathematics, a partial permutation, or sequence without repetition, on a finite set S is a bijection between two specified subsets of S. That is, it is defined by two subsets U and V of equal size, and a one-to-one mapping from U to V. Equivalently, it is a partial function on S that can be extended to a permutation.
In this case, a partial permutation may be represented by a string of n symbols, some of which are distinct numbers in the range from 1 to
[3] The seven partial permutations on two items are The number of partial permutations on n items, for n = 0, 1, 2, ..., is given by the integer sequence where the nth item in the sequence is given by the summation formula in which the ith term counts the number of partial permutations with support of size i, that is, the number of partial permutations with i non-hole entries.
Alternatively, it can be computed by a recurrence relation This is determined as follows: Some authors restrict partial permutations so that either the domain[4] or the range[3] of the bijection is forced to consist of the first k items in the set of n items being permuted, for some k. In the former case, a partial permutation of length k from an n-set is just a sequence of k terms from the n-set without repetition.
(In elementary combinatorics, these objects are sometimes confusingly called "k-permutations" of the n-set.)