The combinatorics seminar at KTH

Sep 24, 2008

Alexander Engström (KTH): The geometry of cut polytopes

Abstract:

I will first give a basic survey on cut polytopes in discrete mathematics and optimization. Then I will explain their use in algebraic statistics and in particular my proof of a conjecture by Sturmfels and Sullivant.

Back to the combinatorics seminar