An entropy proof of Bregman's theorem
From MaRDI portal
Publication:5961543
DOI10.1006/jcta.1996.2727zbMath0894.15007OpenAlexW2052510900WikidataQ117714851 ScholiaQ117714851MaRDI QIDQ5961543
Publication date: 12 August 1998
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.2727
Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45) Matrices of integers (15B36)
Related Items
On the maximum number of Latin transversals ⋮ Extremal Graphs With a Given Number of Perfect Matchings ⋮ Asymptotics of the upper matching conjecture ⋮ Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures ⋮ A proof of Tomescu's graph coloring conjecture ⋮ The number of \(n\)-queens configurations ⋮ Entropy bounds for perfect matchings and Hamiltonian cycles ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Randomly colouring graphs (a combinatorial view) ⋮ New bounds for perfect \(k\)-hashing ⋮ An upper bound on the number of high-dimensional permutations ⋮ A proof of the upper matching conjecture for large graphs ⋮ Notes on use of generalized entropies in counting ⋮ An upper bound for permanents of nonnegative matrices ⋮ Enumerating extensions of mutually orthogonal Latin squares ⋮ An Entropy-Based Proof for the Moore Bound for Irregular Graphs ⋮ Further results on generalized conditional entropies ⋮ Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ An algorithmic proof of Brégman–Minc theorem ⋮ An upper bound on the number of Steiner triple systems ⋮ A Tight Analysis of Bethe Approximation for Permanent
