The Bregman-Minc inequality is a result in discrete mathematics that bounds the permanent of a binary matrix using only its row or column sums. Henryk Minc conjectured the inequality in 1963, and Lev M. Bregman proved it in 1973, with further proofs based on entropy later given by Alexander Schrijver and Jaikumar Radhakrishnan. It is applied in graph theory, for instance to obtain upper bounds on the number of perfect matchings in a bipartite graph. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Sources
1. Wikipedia: Bregman-Minc inequality
WikipediaLead section, statement-form referenceQuote, Lead section, statement-form reference
In discrete mathematics, the Bregman-Minc inequality, or Bregman's theorem, allows one to estimate the permanent of a binary matrix via its row or column sums.
2. Bregman-Minc inequality (Wikipedia)
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.