In combinatorial mathematics, a partial permutation, also called a sequence without repetition, on a finite set S is a bijection between two specified subsets of that set. It is defined by two subsets U and V of S of equal size together with a one to one mapping from U to V, and is equivalent to a partial function on S that can be extended to a full permutation of S. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
In Branch
Source Partial Permutation (Wikipedia)
Is Kind Of Object
Sources
1. Partial Permutation (Wikipedia)
Lead section
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 Branch: Combinatorics, Lead paragraph
In combinatorial mathematics, a partial permutation, or sequence without repetition, on a finite set S is a bijection between two specified subsets of S.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.