Pólya's permanent problem

Abstract

A square real matrix is sign-nonsingular if it is forced to be nonsingular by its pattern of zero, negative, and positive entries. We give structural characterizations of sign-nonsingular matrices, digraphs with no even length dicycles, and square non-negative real matrices whose permanent and determinant are equal. The structural characterizations, which are topological in nature, imply polynomial algorithms.