On Minc's sixth conjecture

Ian M. Wanless*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Let Λnk denote the set of n × n binary matrices which have each row and column sum equal to k. Minc's Conjecture 6 asserts that minAεΛnk per((1/k)A) is monotone decreasing in k. Here, three special cases of this conjecture and also of the corresponding statement for the maximum permanent in Λnk are proved. The three cases are for matrices which are sufficiently (i) small, (ii) sparse or (iii) dense.

Original languageEnglish
Pages (from-to)57-63
Number of pages7
JournalLinear and Multilinear Algebra
Volume55
Issue number1
DOIs
Publication statusPublished - 1 Jan 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'On Minc's sixth conjecture'. Together they form a unique fingerprint.

Cite this