Walsh permutation

The term n-bit Walsh permutation was chosen by the author for permutations of 2ⁿ elements, that permute Walsh functions into other Walsh functions.

Walsh permutations of 2ⁿ elements can be represented by an n-element compression vector
of integers $\in \{1,...,2^{n}-1\}$ referring to the numbering of Walsh functions (displayed in orange in the images).
It corresponds to the n×n compression matrix. It's columns show the elements of the compression vector in binary representation.
The multiplication of the compression matrices (with F₂ operations) corresponds to the composition of the permutations.
As the compression matrices are the elements of the general linear group GL(n,2) the Walsh permutations form a group isomorphic to GL(n,2).

There are A002884(n) n-bit Walsh permutations.

Not all vectors $(v_{1},...,v_{n})$ with different elements $\in \{1,...,2^{n}-1\}$ correspond to Walsh permutations, as the following example shows:

No Walsh permutation wp(1,2,3,4)

The corresponding compression matrix would be

which has determinant 0.

Notation warning edit

This article and its subpages currently use two different ways to name and display Walsh permutations. In older files the direction of the compression vector is horizontal, and the permutation is vertical. In new files both compression vector and permutation are horizontal. The old files are gradually replaced. 3-bit Walsh permutation already uses new files.

wp(1, 3, 5) new
= wp(7, 2, 4) old

Ambiguity of wp(1, 3, 5)

new: horizontal (0, 1, 3, 2, 5, 4, 6, 7)
old: vertical (0, 7, 2, 5, 4, 3, 6, 1)

wp(1, 14, 4, 8) old
= wp(1, 2, 6, 10) new

Bit permutation edit

When a simple permutation of n elements is applied on the binary digits of numbers from 0 to 2ⁿ-1 the result is a permutation of the numbers from 0 to 2ⁿ-1.
The example on the right corresponds to the simple permutation that swaps the first two and the last two digits of the 4-bit binary numbers.
Probably the most important bit permutation is the bit-reversal permutation.

Nimber multiplication edit

The rows of each nimber multiplication table are Walsh permutations (except row 0).
They are not only closed under multiplication (function composition), but even under addition (bitwise XOR).

Gray code permutation powers edit

Cayley table with compression matrices

Powers of the Gray code permutation have very simple compression matrices and vectors.
In each vector all entries follow from the first one, and the first entries follow from the rows of the Sierpinski triangle.

Sequency ordered Walsh matrix edit

The permutation that changes the natural ordered into the sequency ordered Walsh matrix is the product of the Gray code permutation and the bit-reversal permutation.

Bent functions edit

From 0111 1000 1000 1000 to wp(2,1,8,4)

Each bent function corresponds to a Walsh permutation.
This can be seen when all rows of its sec matrix are XORed with the function itself (second step in the example on the right).

Magic squares edit

Multigrade operator XOR
These matrices are found in the dual matrices of the magic squares.

The Melencolia square, corresponding to wp(11, 7,14,13)

There are 24*9=216 Walsh permutations that correspond to magic squares of order 4.
One my say that only 6 of them are essentially different.

Inversions edit

wp(13,11, 7,15)

wp(14,13,11, 7)

wp( 4, 8, 1, 2)

Some inversion sets of Walsh permutations are very regular.
E.g. there are 2ⁿ-1 n-bit Walsh permutations with horizontally striped inversion sets (like the left one of the examples).
The pattern of the stripes is that of Walsh functions.