MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Take all the $n\times n$ matrices of 0's and 1's and define an equivallence relation as follows: Two matrices are equal if there is a way to pass from the one to another by alternating the columns and the rows.(acting by $S_n$ on the columns and on the rows)

Is there a good way to determine whether two such matrices are equal?

Are there any good invariants (polynomials ,etc.)?

The obvious invariant is that the sum of the 1's on the rows and on the columns does not change.

share|cite|improve this question
up vote 13 down vote accepted

This is the graph isomorphism problem.

More precisely, if you have to permute the rows and the columns by the same permutation, then this is graph isomorphism (use $1$ to code "edge present" and $0$ to code "edge absent".) If you are allowed to use different permutations on rows and columns, then this is bipartie graph isomorphism, which is equivalent to graph isomorphism.

In practice, algorithms for Graph Isomorphism are pretty fast; however, it is not known whether there is a polynomial time method to test whether two graphs are isomorphic or, equivalently, whether two matrices are equal under your operations.

share|cite|improve this answer
I was just about to write that! – Per Alexandersson Mar 29 '11 at 17:31
thanx! that's the right answer – asterios gantzounis Mar 29 '11 at 17:35

The determinant would be invariant under the permutations you outlined.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.