An entropy proof of Bregman's theorem (Q5961543): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:26, 30 January 2024
scientific article; zbMATH DE number 981647
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An entropy proof of Bregman's theorem |
scientific article; zbMATH DE number 981647 |
Statements
An entropy proof of Bregman's theorem (English)
0 references
12 August 1998
0 references
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.
0 references
\((0,1)\)-matrix
0 references
permanent inequality
0 references
