The Birkhoff polytope is the convex polytope whose points are the doubly stochastic matrices matrices whose entries are non-negative real numbers and whose rows and columns each add up to 1. It is named after Garrett Birkhoff, and also called the assignment polytope, the polytope of doubly stochastic matrices, or the perfect matching polytope of the complete bipartite graph.

Properties

Vertices

items. This follows from the Birkhoff–von Neumann theorem, which states that the extreme points of the Birkhoff polytope are the permutation matrices, and therefore that any doubly stochastic matrix may be represented as a convex combination of permutation matrices; this was stated in a 1946 paper by Garrett Birkhoff, but equivalent results in the languages of projective configurations and of regular bipartite graph matchingss, respectively, were shown much earlier in 1894 in Ernst Steinitz's thesis and in 1916 by Dénes Kőnig. Because all of the vertex coordinates are zero or one, the Birkhoff polytope is an integral polytope.

Edges

The edges of the Birkhoff polytope correspond to pairs of permutations differing by a cycle: This implies that the graph is a Cayley graph of the symmetric group is a complete graph is a neighborly polytope.

Facets

The Birkhoff polytope lies within an affine subspace of the linear inequalities facets., there are two facets, given by and

Symmetries

is both vertex-transitive and facet-transitive (i.e. the dual polytope is vertex-transitive). It is not regular

Volume

An outstanding problem is to find the volume of the Birkhoff polytopes. This has been done It is known to be equal to the volume of a polytope associated with standard Young tableaux. was given in 2007. The following asymptotic formula was found by Rodney Canfield and Brendan McKay:

the volume was estimated in 2014 while similar estimations follow.

Ehrhart polynomial

Determining the Ehrhart polynomial of a polytope is harder than determining its volume, since the volume can easily be computed from the leading coefficient of the Ehrhart polynomial. The Ehrhart polynomial associated with the Birkhoff polytope is only known for small values. It is conjectured that all the coefficients of the Ehrhart polynomials are non-negative.

Generalizations

• The Birkhoff polytope is a special case of the transportation polytope, a polytope of nonnegative rectangular matrices with given row and column sums. The integer points in these polytopes are called contingency tables; they play an important role in Bayesian statistics.

• The Birkhoff polytope is a special case of the matching polytope, defined as a convex hull of the perfect matchings in a finite graph. The description of facets in this generality was given by Jack Edmonds (1965), and is related to Edmonds's matching algorithm.

• The Birkhoff polytope is a special case of the flow polytope of nonnegative flows through a network. It is related to the Ford–Fulkerson algorithm that computes the maximum flow in a flow network.

See also

• Birkhoff algorithm

• Permutohedron

• Stable matching polytope

References

External links

• The Ehrhart polynomial of the Birkhoff polytope Web site by Dennis Pixton and Matthias Beck, with links to articles and volumes.