An entropy proof of Bregman's theorem

DOI10.1006/JCTA.1996.2727zbMATH Open0894.15007OpenAlexW2052510900WikidataQ117714851 ScholiaQ117714851MaRDI QIDQ5961543FDOQ5961543

Authors: Jaikumar Radhakrishnan 

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

Recommendations

• An algorithmic proof of Brégman–Minc theorem
• An Upper Bound for the Permanent of a 3-Dimensional (0, 1)-Matrix
• An entropy proof of the Kahn-Lovász theorem
• A note on some upper bounds for permanents of (0, 1)-matrices
• scientific article; zbMATH DE number 3966317

zbMATH Keywords

\((0,1)\)-matrixpermanent inequality

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Miscellaneous inequalities involving matrices (15A45)

Cited In (30)

• Entropy bounds for perfect matchings and Hamiltonian cycles
• The number of \(n\)-queens configurations
• A Billingsley type theorem for Bowen entropy
• Proof of an entropy conjecture of Leighton and Moitra
• A proof of Tomescu's graph coloring conjecture
• An Entropy-Based Proof for the Moore Bound for Irregular Graphs
• A simple proof of Wehrl's conjecture on entropy
• On the maximum number of Latin transversals
• An algorithmic proof of Brégman–Minc theorem
• An entropy proof of the Kahn-Lovász theorem
• An upper bound on the number of high-dimensional permutations
• An upper bound for permanents of nonnegative matrices
• Proof of a hypercontractive estimate via entropy
• Further results on generalized conditional entropies
• A proof of the Beyer-Stein-Ulam relation between complexity and entropy
• Enumerating extensions of mutually orthogonal Latin squares
• Randomly colouring graphs (a combinatorial view)
• A proof of the upper matching conjecture for large graphs
• A Tight Analysis of Bethe Approximation for Permanent
• Extremal graphs with a given number of perfect matchings
• Multidimensional permanents and an upper bound on the number of transversals in Latin squares
• New bounds for perfect \(k\)-hashing
• A proof of the estimation from below in Pesin's entropy formula
• An upper bound on the number of Steiner triple systems
• Tight bounds on the coefficients of partition functions via stability
• On the codimension of permanental varieties
• Notes on use of generalized entropies in counting
• Asymptotics of the upper matching conjecture
• Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures
• Permanents of multidimensional matrices: properties and applications

This page was built for publication: An entropy proof of Bregman's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961543)