Sign Up to like & get
recommendations!
2
Published in 2022 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2022.03.020
Abstract: 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$ is a…
read more here.
Keywords:
determinant permanent;
maximum determinant;
sparse matrices;
permanent sparse ... See more keywords