go-v.orgcodex
Menu
Page tools

codex · Philosophy

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 contributors, "Partial permutation", Wikipedia, revision 1344900325, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex