Lower bounds for Pólya's problem on permanent

Mikhail Budrevich; Gregor Dolinar; Alexander Guterman; Bojan Kuzma

doi:10.1142/s0218196716500521

Lower bounds for Pólya's problem on permanent

Mikhail Budrevich, Gregor Dolinar, Alexander Guterman, Bojan Kuzma

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We found the lower bounds on the number of ones in fully indecomposable (0, 1) 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.

Original language	English
Pages (from-to)	1237-1255
Number of pages	19
Journal	International Journal of Algebra and Computation
Volume	26
Issue number	6
DOIs	https://doi.org/10.1142/s0218196716500521
State	Published - 1 Sep 2016
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2016 World Scientific Publishing Company.

Keywords

Pólya's problem
indecomposable matrices
lower bounds

Access to Document

10.1142/s0218196716500521

Cite this

@article{af19581535124d7288a73e7f987ad3b7,

title = "Lower bounds for P{\'o}lya's problem on permanent",

abstract = "We found the lower bounds on the number of ones in fully indecomposable (0, 1) 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.",

keywords = "P{\'o}lya's problem, indecomposable matrices, lower bounds",

author = "Mikhail Budrevich and Gregor Dolinar and Alexander Guterman and Bojan Kuzma",

note = "Publisher Copyright: {\textcopyright} 2016 World Scientific Publishing Company.",

year = "2016",

month = sep,

day = "1",

doi = "10.1142/s0218196716500521",

language = "אנגלית",

volume = "26",

pages = "1237--1255",

journal = "International Journal of Algebra and Computation",

issn = "0218-1967",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "6",

}

TY - JOUR

T1 - Lower bounds for Pólya's problem on permanent

AU - Budrevich, Mikhail

AU - Dolinar, Gregor

AU - Guterman, Alexander

AU - Kuzma, Bojan

PY - 2016/9/1

Y1 - 2016/9/1

N2 - We found the lower bounds on the number of ones in fully indecomposable (0, 1) 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.

AB - We found the lower bounds on the number of ones in fully indecomposable (0, 1) 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.

KW - Pólya's problem

KW - indecomposable matrices

KW - lower bounds

UR - http://www.scopus.com/inward/record.url?scp=84983022134&partnerID=8YFLogxK

U2 - 10.1142/s0218196716500521

DO - 10.1142/s0218196716500521

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84983022134

SN - 0218-1967

VL - 26

SP - 1237

EP - 1255

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

IS - 6

ER -

Lower bounds for Pólya's problem on permanent

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this