Partial permutation
id:
partial-permutation-275-775281
title:
Partial permutation
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Selection in a particular order
original url:
https://en.wikipedia.org/wiki/Partial_permutation
date created:
date modified:
2023-09-24T09:40:29Z
main entity:
{"identifier":"Q1401935","url":"https://www.wikidata.org/entity/Q1401935"}
image:
fields total:
13
integrity:
14