Concept information
Preferred term
partial permutation
Definition(s)
-
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, The Free Encyclopedia, https://en.wikipedia.org/wiki/Partial_permutation)
Broader concept(s)
Synonym(s)
- sequence without repetition
In other languages
-
French
URI
http://data.loterre.fr/ark:/67375/PSR-B8SHNMPL-3
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}