Bregman–Minc Inequality

(Theorems In Discrete Mathematic)

Logo of Bregman–Minc inequality
Theorems In Discrete Mathematic
Link to Dbpedia

What is Bregman–Minc inequality?

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. The inequality was conjectured in 1963 by and first proved in 1973 by Lev M. Bregman. Further entropy-based proofs have been given by Alexander Schrijver and Jaikumar Radhakrishnan. The Bregman–Minc inequality is used, for example, in graph theory to obtain upper bounds for the number of perfect matchings in a bipartite graph.

Technology Types

theorems in discrete mathematic


Bregman-Minc inequalityBregman's Theorem

Tech Info

Source: [object Object]
 — Date merged: 11/6/2021, 1:32:44 PM
 — Date scraped: 5/20/2021, 6:03:01 PM