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 Henryk Minc and first proved in 1973 by Lev M.

[1][2] Further entropy-based proofs have been given by Alexander Schrijver and Jaikumar Radhakrishnan.

[3][4] 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.

The permanent of a square binary matrix

with row sums

can be estimated by The permanent is therefore bounded by the product of the geometric means of the numbers from

Equality holds if the matrix is a block diagonal matrix consisting of matrices of ones or results from row and/or column permutations of such a block diagonal matrix.

Since the permanent is invariant under transposition, the inequality also holds for the column sums of the matrix accordingly.

[5][6] There is a one-to-one correspondence between a square binary matrix

and a simple bipartite graph

with equal-sized partitions

by taking This way, each nonzero entry of the matrix

defines an edge in the graph

A perfect matching in

edges, such that each vertex of the graph is an endpoint of one of these edges.

Each nonzero summand of the permanent of

satisfying corresponds to a perfect matching

denotes the set of perfect matchings of

The Bregman–Minc inequality now yields the estimate where

is the degree of the vertex

Due to symmetry, the corresponding estimate also holds for

The number of possible perfect matchings in a bipartite graph with equal-sized partitions can therefore be estimated via the degrees of the vertices of any of the two partitions.

[7] Using the inequality of arithmetic and geometric means, the Bregman–Minc inequality directly implies the weaker estimate which was proven by Henryk Minc already in 1963.

Another direct consequence of the Bregman–Minc inequality is a proof of the following conjecture of Herbert Ryser from 1960.

denote the set of square binary matrices of size

with row and column sums equal to

, then The maximum is thereby attained for a block diagonal matrix whose diagonal blocks are square matrices of ones of size

A corresponding statement for the case that

is an open mathematical problem.