Pólya convertibility problem for symmetric matrices

A. Guterman, G. Dolinar, B. Kuz'ma

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We investigate symmetric (0, 1) matrices on which the permanent is convertible to the determinant by assigning ± signs to their entries. In particular, we obtain several quantitative bounds for the number of nonzero elements of such matrices, including the analog of Gibson's theorem for symmetric matrices.

Original languageEnglish
Pages (from-to)624-635
Number of pages12
JournalMathematical Notes
Volume92
Issue number5-6
DOIs
StatePublished - 2012
Externally publishedYes

Bibliographical note

Funding Information:
The work is supported in part by the joint Slovenian–Russian grant no. BI-RU/12-13-022. The work of the first author is also partially supported by grant no. MD-2502.2012.1 and by the Russian Foundation for Basic Research (grant no. 12-01-00140-a).

Funding

The work is supported in part by the joint Slovenian–Russian grant no. BI-RU/12-13-022. The work of the first author is also partially supported by grant no. MD-2502.2012.1 and by the Russian Foundation for Basic Research (grant no. 12-01-00140-a).

FundersFunder number
Russian Foundation for Basic Research12-01-00140-a

    Keywords

    • conversion
    • determinant
    • permanent
    • symmetric matrix

    Fingerprint

    Dive into the research topics of 'Pólya convertibility problem for symmetric matrices'. Together they form a unique fingerprint.

    Cite this