Abstract
We study lower bounds on the number of nonzero entries in (0, 1) matrices such that the permanent is always convertible to the determinant by placing ± signs on matrix entries.
| Original language | English |
|---|---|
| Pages (from-to) | 224-232 |
| Number of pages | 9 |
| Journal | Journal of Mathematical Sciences (United States) |
| Volume | 185 |
| Issue number | 2 |
| DOIs | |
| State | Published - Aug 2012 |
| Externally published | Yes |
Bibliographical note
Funding Information:This work was partially supported by the joint Slovene–Russian grant BI-RU/10-11-010. Also the work of the second author was partially supported by the grant MD-2535.2009.1 and by RFBR grant 09-01-00303.
Funding
This work was partially supported by the joint Slovene–Russian grant BI-RU/10-11-010. Also the work of the second author was partially supported by the grant MD-2535.2009.1 and by RFBR grant 09-01-00303.
| Funders | Funder number |
|---|---|
| Russian Foundation for Basic Research | 09-01-00303 |
Fingerprint
Dive into the research topics of 'On the gibson barrier for the pólya problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver