Ryser's maximum permanent conjecture for regular (0,1)-matrices
Ryser's maximum permanent conjecture for regular (0,1)-matrices
Let be the set of all -matrices of order with exactly 1's in each row and column. Let be the all-1 matrix of order , and suppose that divides . Let be the direct sum of copies of . Then .
Ryser's conjecture. The permanent of is maximal in .
This is a classical extremal problem for permanents of regular -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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.