Maximum determinant and permanent of sparse 0-1 matrices

Igor Araujo, József Balogh, Yuzhou Wang

We prove that the maximum determinant of an $n\times n$ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k…