Results 1 
5 of
5
A generating function for all semimagic squares and the volume of the Birkhoff polytope
 J. Algebraic Combin
"... Abstract. We present a multivariate generating function for all n×n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semimagic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope Bn of n×n ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We present a multivariate generating function for all n×n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semimagic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope Bn of n×n doublystochastic matrices, also known as the Birkhoff polytope. In particular we derive formulas for the volumes of Bn and any of its faces. 1.
Formulas for the volumes of the polytope of doublystochastic matrices and its faces, preprint arXiv math.CO/0701866
, 2007
"... Abstract. We provide an explicit combinatorial formula for the volume of the polytope of n×n doublystochastic matrices, also known as the Birkhoff polytope. We do this through the description of a generating function for all the lattice points of the closely related polytope of n×n real nonnegativ ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We provide an explicit combinatorial formula for the volume of the polytope of n×n doublystochastic matrices, also known as the Birkhoff polytope. We do this through the description of a generating function for all the lattice points of the closely related polytope of n×n real nonnegative matrices with all row and column sums equal to an integer t. We can in fact recover similar formulas for all coefficients of the Ehrhart polynomial of the Birkhoff polytope and for all its faces. 1.
Sums of Squares of Polynomial, Polynomial Optimization Problem, Semidefinite Program,
, 2003
"... Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and SDP (semidefinite programming) relaxation of polynomial optimization problems. We disscuss effective me ..."
Abstract
 Add to MetaCart
Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and SDP (semidefinite programming) relaxation of polynomial optimization problems. We disscuss effective methods to obtain a simpler representation of a “sparse” polynomial as a sum of squares of sparse polynomials by eliminating redundancy. Key words.