Bregman–Minc inequality
id:
bregman-minc-inequality-194-1857607
title:
Bregman–Minc inequality
text:
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 Henryk Minc 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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bregman%E2%80%93Minc_inequality
date created:
date modified:
2023-01-29T19:31:14Z
main entity:
{"identifier":"Q25304301","url":"https://www.wikidata.org/entity/Q25304301"}
image:
fields total:
13
integrity:
13