English

Maximal determinants of sparse zero-one matrices

Combinatorics 2019-03-04 v3

Abstract

We give upper bounds for the determinant of an n×nn\times n zero-one matrix containing knkn ones for integral kk. Our results improve upon a result of Ryser for k=o(n1/3)k=o(n^{1/3}). For fixed k3k\ge 3 it was an open question whether Hadamard's inequality could be exponentially improved. We answer this in the affirmative. Our results stem from studying matrices with row sums kk and bounding their Gram determinants. Our technique allows us to give upper bounds when these matrices are perturbed.

Keywords

Cite

@article{arxiv.1902.09644,
  title  = {Maximal determinants of sparse zero-one matrices},
  author = {Daniel Scheinerman},
  journal= {arXiv preprint arXiv:1902.09644},
  year   = {2019}
}

Comments

23 pages

R2 v1 2026-06-23T07:50:56.830Z