3-bit Walsh permutation/matrix columns

There are 25 transforms that look similar to the neutral position. This is the case when the view from one or two axes remains the same or almost the same. Almost the same means, that the original square is into a (simple) parallelogram.

These are the 25 permutations in the middle cluster of the positive component of the neighbor graph. (There are only 18 transforms that do not look like a square or simple parallelogram from any side, namely those who's matrices have seven 1s.)

The big table below shows all 168 transforms in 28 rows and 6 columns. The shown transforms are those with binary matrices. For the transforms with matrices that have some negative entries see here.

For the 25 rows with sums < 7 the position in the table corresponds with that in the neighbor graph: Left, middle or right cluster in the positive or negative component.

Permutations in the same row have the same complement pattern, and each complement pattern corresponds to four rows.

The big table can be sorted by some properties of the permutations in the main column:
 * cc conjugacy class
 * cs cycle shape: abbreviated (city) name of the cycle shape; below the sum (3...7), which corresponds to the position in the cluster (which is why 5a and 5b are distinguished)
 * cp complement pattern: above the weight (1...3), below the value (1...7)
 * t triple of numbers used in the vectors in the row (number in ascending order)

Let $$S$$ be a permutation from the symmetric subgroup in the top row, and $$M$$ a permutation in the main column. Then the permutation in the row of $$M$$ and the column of $$S$$ is $$P = M \cdot S$$. E.g. 314 (second row, negative left column) is 134 ⋅ 214.