Events by date

Title: Subgraph Polytopes and Independence Polytopes of Count Matroids

Speaker: David Aleman Affiliation: University of Waterloo Location: MC 6029

Abstract: Given a graph G=(V,E), the subgraph polytope of G is defined as the convex hull of the characteristic vector of the pairs (S,F) such that S is a non-empty subset of vertices and F is a set of edges contained in the induced subgraph G[S].

Title: On the complexity of quantum partition functions

Speaker: David Gosset Affiliation: University of Waterloo Location: MC 5501 or contact Eva Lee for Zoom link

Abstract: Quantum complexity theory has been intertwined with the study of quantum many-body systems ever since Kitaev's insight that computing their ground energies is an intractable quantum constraint satisfaction problem that is complete for a quantum generalization of NP.