Given an $n \times n$ matrix whose entries are pairwise distinct, how many different matrices can you generate by:
- exchanging columns $i$ and $n-i+1$
- exchanging rows $i$ and $n-i+1$
- mirroring the matrix along the main diagonal
- mirroring the matrix along the antidiagonal
- rotating the matrix clockwise (90°, 180°, 270°)
I'm not sure if my ideas and calculations are correct, so I'd be grateful if you could look over it and see if you can spot any blatant mistakes.
My idea was that the only three 'atomic' operations are exchanging columns/rows and mirroring across one diagonal. All the other operations can be produced by a combination of these three.
That leaves me with the two cases of $n$ being odd or even.
- $n$ is even: you can exchange $n/2$ pairs of rows (and columns, respectively), and you can mirror along the diagonal. So the amount of different matrices is $2^{n/2} \cdot 2^{n/2} \cdot 2 = 2^{n+1}$
- $n$ is odd: you have $(n-1)/2$ pairs of rows/columns. Makes $2^{(n-1)/2} \cdot 2^{(n-1)/2} \cdot 2 = 2^{n}$
Are the formulas correct? I checked by drawing all possible $2 \times 2$ and $3 \times 3$ matrices but I don't know how to verify for $n > 3$.
Maybe this is better suited to be proven by induction?