An entropy proof of Bregman's theorem (Q5961543)

The theorem in question is due to \textit{L. M. Brégman} [Dokl. Akad. Nauk SSSR 211, 27-30 (1973; Zbl 0293.15010)]. It states that, if \(A\) is an \(n \times n\) \((0,1)\)-matrix whose row sums are \(r_{i}\) (\(i = 1,2,\ldots ,n\)), then \(\text{perm}(A) \leq \prod^{n}_{i=1} (r_{i}!)^{1/r_{i}}\). Several proofs are known. In the present paper the author presents a proof based on an entropy argument.