Pólya's Permanent Problem
Pólya's Permanent Problem
复制标题
DOI：
10.37236/1832
复制
发表时间：
2004-06
期刊：
影响因子：
--
通讯作者：
W. McCuaig
中科院分区：
文献类型：
--
作者：
W. McCuaig
一个正方形真实的矩阵是符号非奇异的，如果它被它的零、负和正元素的模式强制为非奇异的。给出了符号非奇异矩阵、无偶长双圈的有向图和积和行列式相等的平方非负真实的矩阵的结构刻画。的结构特征，这是拓扑性质，意味着多项式算法。
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.