Schoute permutation

From Wikiversity
Jump to navigation Jump to search

Schoute matrix
rows: Schoute permutations
columns: Schoute partitions

Schoute permutations of degree 4 assigned to finite permutations of 4 elements

A Schoute permutation is a Walsh permutation corresponding to a permutation matrix.
It can be seen as a permutation of hypercube vertices derived from a permutation of coordinate axes.
In the signed case (see below) the axes can also change their directions.

A Schoute permutation or degree d has length 2d.
Like with all Walsh permutations, it makes sense to see them as periodic.
The n-th Schoute permutation is row n of the number triangle Sloane'sA195665.

The most well known Schoute permutations are the bit-reversal permutations.
They are always the last row in a finite Schoute matrix, because the reversal is always the last among the finite permutations.

Also well known (but very forgettable) are those that simply sort the even before the odd numbers. (The corresponding finite permutations are the left shifts.)

Schoute permutations
signed Schoute permutations


[edit | edit source]

These number patterns appear in many sources related to computer science.


[edit | edit source]
reflection of cube vertices

A signed Schoute permutation is a Schoute permutation permuted by the row of a XOR table.
It corresponds to a signed permutation (but is not itself signed).
This file shows all 16·24 = 384 signed Schoute permutations of degree 4. Each 16×16 matrix shows a Schoute permutation in the top row and its XOR permutations below.