Any possible arrangement of n different elements is called a permutation of these elements. Permutations (without repetition) can also be interpreted as functions: they are bijective self-mappings that transform a fixed standard arrangement of elements (for example, the header of the group table) into another arrangement. Permutations appear in many branches of mathematics and sciences.