An entropy proof of Bregman's theorem

DOI10.1006/JCTA.1996.2727MaRDI QIDQ5961543zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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

Cited in

(33)

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

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)