Lower bounds for Pólya’s problem on permanent-Reference-Cited by-同舟云学术

Lower bounds for Pólya’s problem on permanent

Published:2016-08-31 Issue:06 Volume:26 Page:1237-1255
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

Budrevich Mikhail¹²,Dolinar Gregor³,Guterman Alexander¹²,Kuzma Bojan⁴⁵

Affiliation:

1. Faculty of Algebra, Department of Mathematics and Mechanics, Moscow State University, Moscow, GSP-1, 119991, Russia

2. Moscow Center for Continuous Mathematical Education, Bolshoy Vlasyevskiy Pereulok 11, Moscow, 119002, Russia

3. Faculty of Electrical Engineering, University of Ljubljana, Tržaška cesta 25, Ljubljana, SI-1000, Slovenia

4. University of Primorska, Glagoljaška 8, Koper, SI-6000, Slovenia

5. IMFM, Jadranska 19, Ljubljana, SI-1000, Slovenia

Abstract

We found the lower bounds on the number of ones in fully indecomposable [Formula: see text] matrices such that their permanents are equal to the determinants of matrices obtained by a suitable change of signs in the entries. We consider separately general case and the case of symmetric matrices with vanishing diagonals.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196716500521

Reference12 articles.

1. Matrices of Sign-Solvable Linear Systems

2. On sign-nonsingular matrices and the conversion of the permanent into the determinant

3. On maximal convertible matrices

4. A characterization of convertible (0, 1)-matrices

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones;Ars Mathematica Contemporanea;2019-09-10