Person
We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of [P. de la Harpe, V.F.R. Jones, Graph invariants related to statistical mechanical models: examples and problems, J. Combin. Theory Ser. B 57 (1993)
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and applications. The purpose of this handbook chapter is to give
interview
We give a concise exposition of the elegant proof given recently by Leonid Gurvits for several lower bounds on permanents.
Go to page top
Go back to contents
Go back to site navigation