Abstract
In the present paper, the existence problem for nonconvertible (0, 1) matrices is solved completely. A similar result is obtained for the set of symmetric (0, 1)-matrices.
Similar content being viewed by others
References
G. Dolinar, A.É. Guterman, and B. Kuz’ma, “On the Gibson barrier for the Pólya problem,” Fundam. Prikl. Mat. 16(8), 73–86 (2010) [J.Math. Sci. (New York) 185 (2), 224–232 (2012)].
A.É. Guterman, G. Dolinar, and B. Kuz’ma, “Pólya convertibility problem for symmetric matrices,” Mat. Zametki 92(5), 684–698 (2012) [Math. Notes 92 (5), 624–635 (2012)].
H. Minc, Permanents (Addison-Wesley Publishing Co., Reading, Mass., 1978; Mir, Moscow, 1982).
L. G. Valiant, “The complexity of computing the permanent,” Theoret. Comput. Sci. 8(2), 189–201 (1979).
G. Pólya, “Aufgabe 424,” Arch. der Math. u. Phys. (3) 20, 271 (1913).
G. Szegö, “Lösung zu 424,” Arch. der Math. u. Phys. (3) 21, 291–292 (1913).
P. M. Gibson, “Conversion of the permanent into the determinant,” Proc. Amer. Math. Soc. 27, 471–476 (1971).
V. E. Tarakanov and R. A. Zatorskii, “On a relationship between determinants and permanents,” Mat. Zametki 85(2), 292–299 (2009) [Math. Notes 85 (1–2), 267–273 (2009)].
C. H. C. Little, “A characterization of convertible (0, 1)-matrices,” J. Combin. Theory. Ser. B 18(3), 187–208 (1975).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M. V. Budrevich, 2014, published in Matematicheskie Zametki, 2014, Vol. 96, No. 2, pp. 186–193.
Rights and permissions
About this article
Cite this article
Budrevich, M.V. Construction of nonconvertible (0, 1) Matrices. Math Notes 96, 180–186 (2014). https://doi.org/10.1134/S0001434614070189
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434614070189