The Kim-Roush Conjecture on the Maximum of per(I-A) in Odd Order
Kim and Roush did not claim uniqueness; the classification of equality cases is new alongside the conjecture itself.
algebra / Matrix theory
For the set of $n \times n$ doubly stochastic matrices, Kim and Roush conjectured in 1981 that for odd $n = 2k+1 > 1$ the maximum of $\mathrm{per}(I-A)$ equals $3 \cdot 2^{k-2}$, attained by an explicit block construction. Proved in full, and the maximizers are classified: they are exactly the simultaneous-permutation conjugates of that construction.
Temporal state
No reconciled state yet.
Append-only history
Kim and Roush did not claim uniqueness; the classification of equality cases is new alongside the conjecture itself.
Research memory
For the set of $n \times n$ doubly stochastic matrices, Kim and Roush conjectured in 1981 that for odd $n = 2k+1 > 1$ the maximum of $\mathrm{per}(I-A)$ equals $3 \cdot 2^{k-2}$, attained by an explicit block construction. Proved in full, and the maximizers are classified: they are exactly the simultaneous-permutation conjugates of that construction.
Kim and Roush did not claim uniqueness; the classification of equality cases is new alongside the conjecture itself.
Evidence graph
No public relationships recorded yet.