The permanent of an n x n integer matrix with all entries either 0 or 1 is 0 iff the matrix contains an r x s submatrix of 0s with r + s = n + 1. This result follows from the Konig-Egevary theorem.

This has applications in fair cake cutting.

Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.