Pólya's permanent problem
The electronic journal of combinatorics, Tome 11 (2004) no. 1
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 nonnegative real matrices whose permanent and determinant are equal. The structural characterizations, which are topological in nature, imply polynomial algorithms.
DOI :
10.37236/1832
Classification :
05C20, 15A15, 05A15
Mots-clés : Pfaffian orientations, sign-nonsingular matrix, unbalanced edge-weighting, brace
Mots-clés : Pfaffian orientations, sign-nonsingular matrix, unbalanced edge-weighting, brace
@article{10_37236_1832,
author = {William McCuaig},
title = {P\'olya's permanent problem},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {1},
doi = {10.37236/1832},
zbl = {1062.05066},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1832/}
}
William McCuaig. Pólya's permanent problem. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1832
Cité par Sources :