engleski

An algorithm for computing the full automorphism group of a matrix

Two matrices A and B are isomorphic, if the matrix B is obtained by permuting the rows and the columns of the matrix A. The ordered pair of these permutations is called an isomorphism from A onto B. An isomorphism from the matrix A onto itself is called an automorphism of the matrix A. In this article we present an algorithm for computing the full automorphism group of a matrix.

algorithm; matrix; automorphism group; strong generating set

nije evidentirano