Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 18 Feb 2025 in math.CO | (2502.12787v1)

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 n<sup>2−3n≤τ≤</sup>n<sup>2−2n−1n<sup>{2}-3n\leq\tau\leq</sup> n<sup>{2}-2n-1. Furthermore, we also prove the maximum permanents of all matrices in U(n,τ)\mathscr{U}(n,\tau) when σ−kn≡0(mod k+1)\sigma-kn\equiv0 (mod~k+1) and (k+1)n−σ≡0(mod k)(k+1)n-\sigma\equiv0(mod~k), where σ=n<sup>2−τ\sigma=n<sup>{2}-\tau, kn≤σ≤(k+1)nkn\leq\sigma\leq (k+1)n and kk is integer.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.