Ryser's maximum permanent conjecture for regular (0,1)-matrices

Let U(v,k)\mathscr{U}(v,k) be the set of all (0,1)(0,1)-matrices of order vv with exactly kk 1's in each row and column. Let JJ be the all-1 matrix of order kk, and suppose that kk divides vv. Let JJ^* be the direct sum of v/kv/k copies of JJ. Then JU(v,k)J^*\in\mathscr{U}(v,k).

Ryser's conjecture. The permanent of JJ^* is maximal in U(v,k)\mathscr{U}(v,k).

This is a classical extremal problem for permanents of regular (0,1)(0,1)-matrices. The supplied text gives no resolution status, so the conjecture is recorded as open.

Sources & referencesView supporting material

Primary source

Tingzeng Wu, Xiangshuai Dong and Huazhong Lü, “Brualdi-Goldwasser-Michael problem for maximum permanents of (0,1)-matrices”, arXiv:2502.12787 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.