Lower bounds for Pólya's problem on permanent

DOI10.1142/S0218196716500521MaRDI QIDQ2828348zbMATHFDO

Authors Mikhail V. Budrevich, Bojan Kuzma, Gregor Dolinar, Alexander Guterman

Publication date 25 October 2016

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

lower boundsindecomposable matricesPólya's problem

Mathematics Subject Classification ID

Connectivity (05C40) Commutativity of matrices (15A27) Linear transformations, semilinear transformations (15A04)

Recommendations

• On the Gibson barrier for the Pólya problem
• A lower bound for permanents of (0,1)-matrices
• Permanents -- a concise survey
• Pólya convertibility problem for symmetric matrices
• The upper bound and lower bound for the permanent of \((0,1)\)-matrices

Cites work

• scientific article; zbMATH DE number 1805713 (Why is no real title available?)
• scientific article; zbMATH DE number 17634 (Why is no real title available?)
• scientific article; zbMATH DE number 825098 (Why is no real title available?)
• Pólya's permanent problem
• The complexity of computing the permanent

Cited in

(3)

• Graph characterization of fully indecomposable nonconvertible \((0, 1)\)-matrices with minimal number of ones
• scientific article; zbMATH DE number 5839812 (Why is no real title available?)
• On the Gibson barrier for the Pólya problem

This page was built for publication: Lower bounds for Pólya's problem on permanent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828348)