Brualdi-Goldwasser-Michael problem for maximum permanents of {\rm(0,1)}-matrices
Tingzeng Wu, Xiangshuai Dong, Huazhong L\"u

TL;DR
This paper characterizes the maximum permanents of (0,1)-matrices with a fixed number of zeros in specific parameter ranges, extending previous open problems in combinatorial matrix theory.
Contribution
It provides explicit characterizations of maximum permanents for matrices in al{U}(n, au) within certain al{U}(n, au) parameter ranges, solving an open problem.
Findings
Characterized maximum permanents for al{U}(n, au) when n^2 - 3n al{ au} al{n}^2 - 2n - 1.
Derived formulas for maximum permanents under modular conditions involving al{ au} and n.
Extended understanding of maximum permanents in (0,1)-matrices with fixed zero counts.
Abstract
Let be the set of all {\rm(0,1)}-matrices of order with exactly 0's. Brualdi et al. investigated the maximum permanents of all matrices in (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 . In this paper, we focus on the problem. And we characterize the maximum permanents of all matrices in when . Furthermore, we also prove the maximum permanents of all matrices in when and , where , and is integer.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Point processes and geometric inequalities
