English

Brualdi-Goldwasser-Michael problem for maximum permanents of {\rm(0,1)}-matrices

Combinatorics 2025-02-19 v1

Abstract

Let U(n,τ)\mathscr{U}(n,\tau) be the set of all {\rm(0,1)}-matrices of order nn with exactly τ\tau 0's. Brualdi et al. investigated the maximum permanents of all matrices in U(n,τ)\mathscr{U}(n,\tau)(R.A. Brualdi, J.L. Goldwasser, T.S. Michael, Maximum permanents of matrices of zeros and ones, J. Combin. Theory Ser. A 47 (1988) 207--245.). And they put forward an open problem to characterize the maximum permanents among all matrices in U(n,τ)\mathscr{U}(n,\tau). In this paper, we focus on the problem. And we characterize the maximum permanents of all matrices in U(n,τ)\mathscr{U}(n,\tau) when n23nτn22n1n^{2}-3n\leq\tau\leq n^{2}-2n-1. Furthermore, we also prove the maximum permanents of all matrices in U(n,τ)\mathscr{U}(n,\tau) when σkn0(mod k+1)\sigma-kn\equiv0 (mod~k+1) and (k+1)nσ0(mod k)(k+1)n-\sigma\equiv0(mod~k), where σ=n2τ\sigma=n^{2}-\tau, knσ(k+1)nkn\leq\sigma\leq (k+1)n and kk is integer.

Keywords

Cite

@article{arxiv.2502.12787,
  title  = {Brualdi-Goldwasser-Michael problem for maximum permanents of {\rm(0,1)}-matrices},
  author = {Tingzeng Wu and Xiangshuai Dong and Huazhong Lü},
  journal= {arXiv preprint arXiv:2502.12787},
  year   = {2025}
}