bn:02111406n
Noun Concept
EN
Partial permutation  K-permutation  Partial permutations  sequence without repetition  Sequences without repetition
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
Selection of objects in a particular order Wikidata
IS A
HAS INSTANCE
STUDIED BY
Wikipedia
Wikidata
EN
Wikipedia Redirections
EN
Wikidata Alias