: Matemáticas: partial permutation

mathematical analysis > combinatorics > partial permutation

algebra > combinatorics > partial permutation

partial permutation

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)

http://data.loterre.fr/ark:/67375/PSR-B8SHNMPL-3

RDF/XML TURTLE JSON-LD

Loterre