journal article
Nov 06, 2004
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 nonnegative real matrices whose permanent and determinant are equal. The structural characterizations, which are topological in nature, imply polynomial algorithms.
Topics
No keywords indexed for this article. Browse by subject →
Metrics
81
Citations
0
References
Details
- Published
- Nov 06, 2004
- Vol/Issue
- 11(1)
Authors
Cite This Article
William McCuaig (2004). Pólya's Permanent Problem. The Electronic Journal of Combinatorics, 11(1). https://doi.org/10.37236/1832
Related
You May Also Like
Evaluations of $k$-fold Euler/Zagier sums: a compendium of results for arbitrary $k$
J. M. Borwein, D. M. Bradley · 1996
72 citations
On the First Eigenvalue of Bipartite Graphs
Amitava Bhattacharya, Shmuel Friedland · 2008
49 citations